hdu-1698 Just a Hook(线段树成段更新)

/*

Just a Hook
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12147    Accepted Submission(s): 6025


Problem Description
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.





Now Pudge wants to do some operations on the hook.

Let us number the consecutive metallic sticks of the hook from 1 to N. For each operation, Pudge can change the consecutive metallic sticks, numbered from X to Y, into cupreous sticks, silver sticks or golden sticks.
The total value of the hook is calculated as the sum of values of N metallic sticks. More precisely, the value for each kind of stick is calculated as follows:

For each cupreous stick, the value is 1.
For each silver stick, the value is 2.
For each golden stick, the value is 3.

Pudge wants to know the total value of the hook after performing the operations.
You may consider the original hook is made up of cupreous sticks.

 

Input
The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 10 cases.
For each case, the first line contains an integer N, 1<=N<=100,000, which is the number of the sticks of Pudge’s meat hook and the second line contains an integer Q, 0<=Q<=100,000, which is the number of the operations.
Next Q lines, each line contains three integers X, Y, 1<=X<=Y<=N, Z, 1<=Z<=3, which defines an operation: change the sticks numbered from X to Y into the metal kind Z, where Z=1 represents the cupreous kind, Z=2 represents the silver kind and Z=3 represents the golden kind.

 

Output
For each case, print a number in a line representing the total value of the hook after the operations. Use the format in the example.

 

Sample Input
1
10
2
1 5 2
5 9 3
 

Sample Output
Case 1: The total value of the hook is 24.
 

Source
2008 “Sunline Cup” National Invitational Contest 
 

Recommend
wangye

题意
给一组棍子染色，不同的颜色有不同的值，
执行一系列的区间染色后，问这组棍子的总值是多少。
*/
/*线段树的成段更新
先学习了大神的代码，然后自己敲了一遍*/
#include <iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int maxn = 111111;
int h , w , n;
int col[maxn<<2];
int sum[maxn<<2];
void PushUp(int rt)
{
    sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void PushDown(int rt,int m)
{
    if (col[rt])
    {
        col[rt<<1] = col[rt<<1|1] = col[rt];
        sum[rt<<1] = (m - (m >> 1)) * col[rt];//长度和 (l+r)/2-l一样即(r-l+1)-(r-l+1)/2==(l+r)/2-l
        sum[rt<<1|1] = (m >> 1) * col[rt];
        col[rt] = 0;
    }
}
void cre(int l,int r,int rt)
{
    col[rt]=0;
    sum[rt]=1;
    if(l==r)
        return;
    int m= (l+r)>>1;
    cre(lson);
    cre(rson);
    PushUp(rt);
}
void upd(int L,int R,int c,int l,int r,int rt)
{
    if(L<=l&&r<=R)
    {
        col[rt]=c;
        sum[rt]=c*(r-l+1);
        return ;
    }
    PushDown(rt,r-l+1);
    int m =(l+r)>>1;
    if(L<=m)
        upd(L,R,c,lson);
    if(R>m)
        upd(L,R,c,rson);
    PushUp(rt);
}
int main()
{
    int T , n , m;
    scanf("%d",&T);
    for (int cas = 1 ; cas <= T ; cas ++) {
        scanf("%d%d",&n,&m);
        cre(1 , n , 1);
        while (m --) {
            int a , b , c;
            scanf("%d%d%d",&a,&b,&c);
            upd(a , b , c , 1 , n , 1);
        }
        printf("Case %d: The total value of the hook is %d.
",cas , sum[1]);
    }
    return 0;
}