hdu 1698 线段树

Just a Hook

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13742    Accepted Submission(s): 6816

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   |   We have carefully selected several similar problems for you:  1542 1394 2795 1255 1828

 

线段树，需要延迟更新，也就是每次找到最小的更新单元就停下，以后进行更深度的查询或更新时在向下继续。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<string>
#include<cmath>
#include<fstream>
#include<iomanip>

using namespace std;

#define LL long long
#define lson tn<<1, l, m
#define rson tn<<1|1, m, r
#define MAXN 111111
int sum[MAXN<<2], todo[MAXN<<2], t, n, m;

void push_up(int tn){ sum[tn] = sum[tn<<1] + sum[tn<<1|1]; }

void push_down(int tn, int l, int r){
    if(!todo[tn]) return;

    todo[tn<<1] = todo[tn<<1|1] = todo[tn];
    sum[tn<<1] = todo[tn] * ((l + r >> 1) - l);
    sum[tn<<1|1] = todo[tn] * (r - (l + r >> 1));
    todo[tn] = 0;
}

void build(int tn, int l, int r){
    todo[tn] = 0;
    if(l+1 == r){
        sum[tn] = 1;
        return;
    }
    int m = l + r >> 1;
    build(lson);
    build(rson);
    push_up(tn);
}

void update(int tn, int l, int r, int cl, int cr, int tc){
    if(cl<=l && cr>=r){
        todo[tn] = tc;      sum[tn] = tc * (r - l);
        return;
    }
    int m = l + r >> 1;
    push_down(tn, l, r);
    if(cl < m) update(lson, cl, cr, tc);
    if(cr > m) update(rson, cl, cr, tc);
    push_up(tn);
}

int main(){
//    freopen("C:\Users\Administrator\Desktop\in.txt","r",stdin);
    scanf(" %d", &t);
    for(int kase=1; kase<=t; kase++){
        scanf(" %d %d", &n, &m);
        build(1, 1, 1+n);
        while(m--){
            int a, b, c;
            scanf(" %d %d %d", &a, &b, &c);
            update(1, 1, 1+n, a, b+1, c);
        }
        printf("Case %d: The total value of the hook is %d.
", kase, sum[1]);
    }
    return 0;
}