Just a Hook

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
OutputCase 1: The total value of the hook is 24.

题意
给一根棍子染色，不同的颜色有不同的值，问最后的总值是多少

思路
区间整体更新，区间求和

代码

#include<iostream>
#include<algorithm>
using namespace std;
struct node
{
    int l,r,num,lazy;
}tree[500005];
void build(int t,int l,int r)//t:区间内的值在哪个位置
{
    int mid;
    tree[t].l=l;
    tree[t].r=r;
    tree[t].num=r-l+1;
    tree[t].lazy=1;
    if (l==r)
		return;
    mid=(l+r)/2;
    build(2*t+1,l,mid);
    build(2*t+2,mid+1,r);
}
void add(int t,int x,int y,int c)
{
    int mid,l,r;
    l=tree[t].l;
    r=tree[t].r;
    if(l==x&&r==y)
    {
        tree[t].lazy=1;
        tree[t].num=(r-l+1)*c;
        return;
    }
    mid=(l+r)/2;
    if (tree[t].lazy==1)
    {
        tree[t].lazy=0;
        add(2*t+1,l,mid,tree[t].num/(r-l+1));
        add(2*t+2,mid+1,r,tree[t].num/(r-l+1));
    }
    if(x<=mid) add(2*t+1,x,min(mid,y),c);//落在左侧，更新左边
    if(y>mid) add(2*t+2,max(mid+1,x),y,c);//落在右侧，更新右边
    tree[t].num=tree[2*t+1].num+tree[2*t+2].num;//更新现在的位置
}
int find(int t)
{
    if(tree[t].lazy==1) return tree[t].num;
    return find(2*t+1)+find(2*t+2);
}
int main()
{
    int i,j,n,T,m,x,y,c,cnt=1;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        build(0,0,n-1);
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d%d",&x,&y,&c);
            add(0,x-1,y-1,c);
        }
        printf("Case %d: The total value of the hook is %d.\n",cnt++,find(0));
    }
    return 0;
}