Just a Hook 线段树--成段更新
2015-08-24 20:53
288 查看
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23126 Accepted Submission(s): 11591
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.
成段更新(通常这对初学者来说是一道坎),需要用到延迟标记(或者说懒惰标记),简单来说就是每次更新的时候不要更新到底,用延迟标记使得更新延迟到下次需要更新or询问到的时候
#include <cstdio> #include <algorithm> 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]; sum[rt<<1|1]=(m>>1)*col[rt]; col[rt]=0; } } void build(int l,int r,int rt) { col[rt]=0; sum[rt] = 1; if (l == r) return ; int m = (l + r) >> 1; build(lson); build(rson); PushUP(rt); } void updata(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) updata(L,R,c,lson); if(R>m) updata(L,R,c,rson); PushUP(rt); } int main() { int T,n,m,i; scanf("%d",&T); for(i=1; i<=T; i++) { scanf("%d%d",&n,&m); build(1 , n , 1); while (m --) { int a,b,c; scanf("%d%d%d",&a,&b,&c); updata(a,b,c,1,n,1); } printf("Case %d: The total value of the hook is %d.\n",i,sum[1]); } return 0; }
相关文章推荐
- 使用navicat的命令行模式创建修改表和存储过程
- apktool + dex2jar + xjad反编译apk文件
- LeetCode(30) Substring with Concatenation of All Words
- 2015/8/24/自定义Adapter
- hdu 1286 找新朋友
- ReactiveCocoa 学习资料
- LeetCode(30) Substring with Concatenation of All Words
- Java IO与NIO
- Java修饰符关键词大全
- Checkbox ImageView AdapterView 密码显示
- 【Material Design】Toolbar使用
- Spiral Matrix II
- Logback使用以及与log4j区别
- Unity_使用EasyTouch插件碰撞检测失效的解决方法
- 如何移除原生tabBar
- 求多个列的最大值/最小值
- 谈谈Java中的集合
- (转)st(state-threads) coroutine调度
- css3选择器
- bash shell基础特性之二