1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 #include <cmath>
 5 #include <cstring>
 6 using namespace std;
 7 const int Max=100000+3;
 8 int segTree[Max<<2];
 9 int change[Max<<2];
10 int T,q,r,l,z,n;
11 int PushUp(int node)    //回溯，节点更新
12 {
13     segTree[node]=(segTree[node<<1]+segTree[node<<1|1]);
14     return 0;
15 }
16 int PushDown(int node,int arange)    
17 {
18     if(change[node]){
19         change[node<<1]=change[node<<1|1]=change[node];
20         segTree[node<<1]=change[node]*(arange-(arange>>1));
21         segTree[node<<1|1]=change[node]*(arange>>1);
22         change[node]=0;
23     }
24     return 0;
25 }
26 void build(int node,int begin,int end)
27 {
28     segTree[node]=1;
29     change[node]=0;
30     if(begin==end)
31         return;
32     int m=(begin+end)>>1;
33     build(node<<1,begin,m);
34     build(node<<1|1,m+1,end);
35     PushUp(node);
36     return;
37 }
38 int updata(int node,int begin,int end)
39 {
40     if(l<=begin&&end<=r)
41     {
42         segTree[node]=z*(end-begin+1);
43         change[node]=z;
44         return 0;
45     }
46     PushDown(node,end-begin+1);
47     int mid=(begin+end)>>1;
48     if(mid>=l)    updata(node<<1,begin,mid);
49     if(mid<r)    updata(node<<1|1,mid+1,end);
50     PushUp(node);
51 }
52 int main()
53 {
54     int i,j;
55     freopen("in.txt","r",stdin);
56     cin>>T;
57     int k=T;
58     while(T--)
59     {
60         scanf("%d%d",&n,&q);
61         build(1,0,n-1);
62         for(i=0;i<q;i++)
63         {
64             scanf("%d%d%d",&l,&r,&z);
65             l--,r--;
66             updata(1,0,n-1);
67         }
68         printf("Case %d: The total value of the hook is %d.\n",k-T,segTree[1]);
69     }
70 }

 1 #include <cstdio>
 2 using namespace std;
 3 #define maxN 100005
 4 #define m ((L+R)>>1)
 5 int T, N, Q, X, Y, Z, i;
 6 int val[4 * maxN];
 7 void push_down(int o){
 8     val[o * 2] = val[o * 2 + 1] = val[o];
 9     val[o] = 0;
10 }
11 void update(int o, int L, int R){
12     if (X <= L&&R <= Y) val[o] = Z;
13     else{
14         if (val[o]) push_down(o);
15         if (X <= m) update(o * 2, L, m);
16         if (Y > m) update(o * 2 + 1, m + 1, R);
17     }
18 }
19 int sum(int o,int L,int R){
20     if (val[o]) return (R-L+1)*val[o];
21     return sum(o * 2, L, m) + sum(o * 2 + 1, m + 1, R);
22 }
23 int main(){
24     scanf("%d", &T);
25     for (int Case = 1; Case <= T; Case++){
26         val[1] = 1;
27         scanf("%d%d", &N, &Q);
28         for (i = 0; i < Q; i++){
29             scanf("%d%d%d", &X, &Y, &Z);
30             update(1, 1, N);
31         }
32         printf("Case %d: The total value of the hook is %d.\n",Case,sum(1,1,N));
33     }
34     return 0;
35 }