20140719　「线段树　-　区间替换，区间求和」　HDOJ　1698　Just a Hook

最新推荐文章于 2017-02-06 23:30:36 发布

ZONE画派

最新推荐文章于 2017-02-06 23:30:36 发布

阅读量656

点赞数

分类专栏： hdoj 数据结构线段树

本文链接：https://blog.csdn.net/wilson1068/article/details/37959579

版权

hdoj 同时被 3 个专栏收录

26 篇文章 0 订阅

订阅专栏

数据结构

20 篇文章 1 订阅

订阅专栏

线段树

6 篇文章 0 订阅

订阅专栏

Online Judge	Online Exercise	Online Teaching	Online Contests	Exercise Author
F.A.Q Hand In Hand Online Acmers Forum \| Discuss Statistical Charts	Problem Archive Realtime Judge Status Authors Ranklist	C/C++/Java Exams ACM Steps Go to Job Contest LiveCast ICPC@China	STD Contests VIP Contests Virtual Contests DIY \| Web-DIY ^beta Recent Contests	wilson1068 Mail 0 (0) Control Panel Sign Out

7月22-8月21多校联合训练期间，会根据实际负载关闭部分模块，若有不便，请谅解~

Just a Hook

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

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

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

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2014 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.005822(s) query 5, Server time : 2014-07-19 11:03:09, Gzip enabled

Administration

#include <stdio.h>
#include <string.h>
#define MAXN 100100
int sum[MAXN<<2], sign[MAXN<<2];

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

void push_down(int rt, int m){
    if( sign[rt] ){
        sign[rt<<1] = sign[rt];
        sign[rt<<1|1] = sign[rt];
        sum[rt<<1] = (m-(m>>1))*sign[rt];
        sum[rt<<1|1] = (m>>1) * sign[rt];
        sign[rt] = 0;
    }
}

void build(int rt, int l, int r){
    sign[rt] = 0;
    sum[rt] = 1;
    if( l==r ){
        sum[rt] = 1;
        return;
    }
    int mid = (l+r)>>1;
    build(rt<<1, l, mid);
    build(rt<<1|1, mid+1, r);
    push_up(rt);
}

void updata(int rt, int l, int r, int x, int y, int p){
    if( x<=l && r<=y ){
        sign[rt] = p;
        sum[rt] = (r-l+1)*p;
        return;
    }
    push_down(rt, r-l+1);
    int mid = (l+r)>>1;
    if( x<=mid )    updata(rt<<1, l, mid, x, y, p);
    if( mid<y )     updata(rt<<1|1, mid+1, r, x, y, p);
    push_up(rt);
}

int query(int rt, int l, int r, int x, int y){
    if( x<=l && r<=y ){
        return sum[rt];
    }
    push_down(rt, r-l+1);
    int mid = (l+r)>>1, rL=0, rR=0;
    if( x<=mid )    rL = query(rt<<1, l, mid, x, y);
    if( mid<y )     rR = query(rt<<1|1, mid+1, r, x, y);
    return rL+rR;
}

int main(){        // freopen("111.txt","r",stdin);
    int T, n, m, x, y, p;
    while( EOF != scanf("%d", &T) ){
        for(int t=1; t<=T; t++){
            scanf("%d%d", &n, &m);
            build(1,1,n);
            for(int i=0; i<m ;i++){
                scanf("%d%d%d", &x, &y, &p);
                updata(1,1,n,x,y,p);
            }
            printf("Case %d: The total value of the hook is %d.\n", t, sum[1]);
        }
    }
    return 0;
}