HDU1698 Just a Hook 【线段树】+【成段更新】+【lazy标记】
来源:互联网 发布:日式咖喱饭的做法知乎 编辑:程序博客网 时间:2024/05/16 11:48
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15889 Accepted Submission(s): 7897
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.
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.
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
11021 5 25 9 3
Sample Output
Case 1: The total value of the hook is 24.
Source
2008 “Sunline Cup” National Invitational Contest
这题是线段树的成段更新,要用到lazy标记,也叫延迟标记,每次更新的时候不要更新到底,只是更新当前区段,然后标记下一层但不再更新,剩下的等下次查询时再更新。
//#define DEBUG#include <stdio.h>#define maxn 100002#define lson l, mid, rt << 1#define rson mid + 1, r, rt << 1 | 1int tree[maxn << 2], lazy[maxn << 2];void pushDown(int l, int r, int rt){int mid = (l + r) >> 1;tree[rt << 1] = (mid - l + 1) * lazy[rt];tree[rt << 1 | 1] = (r - mid) * lazy[rt];lazy[rt << 1] = lazy[rt << 1 | 1] = lazy[rt];lazy[rt] = 0;}void build(int l, int r, int rt){lazy[rt] = 0;if(l == r){tree[rt] = 1; return;}int mid = (l + r) >> 1;build(lson);build(rson);tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];}void update(int left, int right, int val, int l, int r, int rt){if(left == l && right == r){tree[rt] = val * (r - l + 1);lazy[rt] = val; return;} //include l == rif(lazy[rt]) pushDown(l, r, rt);int mid = (l + r) >> 1;if(right <= mid) update(left, right, val, lson);else if(left > mid) update(left, right, val, rson);else{update(left, mid, val, lson);update(mid + 1, right, val, rson);}tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];}int main(){#ifdef DEBUGfreopen("../stdin.txt", "r", stdin);freopen("../stdout.txt", "w", stdout);#endifint t, n, q, cas, a, b, c;scanf("%d", &t);for(cas = 1; cas <= t; ++cas){scanf("%d%d", &n, &q);build(1, n, 1);while(q--){scanf("%d%d%d", &a, &b, &c);update(a, b, c, 1, n, 1);}printf("Case %d: The total value of the hook is %d.\n", cas, tree[1]);}return 0;}
0 0
- HDU1698 Just a Hook 【线段树】+【成段更新】+【lazy标记】
- HDU1698 Just a Hook(线段树+成段更新+lazy标记)
- hdu1698 Just a Hook(成段替换 lazy标记)
- hdu1698 Just a Hook 线段树,成段更新
- 线段树---成段更新hdu1698 Just a Hook
- HDU1698 Just a Hook [lazy+成段更新]
- hdu1698 Just a Hook(成段更新+懒惰标记)
- hdu1698 Just a Hook (线段树区间更新 懒惰标记)
- hdu1698 Just a Hook 线段树区间更新,延时标记
- HDU1698 线段树+区间更新+懒惰标记-Just a Hook
- [线段树]hdu1698 Just a Hook(区间更新、延迟标记
- hdu1698 Just a Hook(线段树 区间更新+懒惰标记)
- hdu1698 Just a Hook 线段树更新延迟标记
- hdu1698 Just a Hook(线段树成段更新lazy)
- HDU1698 Just a Hook--线段树LAZY操作
- hdu1698 Just a Hook 线段树延迟标记区间更新 求加权区间总和
- hdu1698 Just a hook (线段树 延迟标记 区间更新)
- hdu1698-Just a Hook (线段树区间更新)(延迟标记)
- POJ 1328:Radar Installation
- 避免最常见的 10 大 JNI 编程错误的技巧和工具
- jps could not synchronize with target
- Linux下批量修改文件名(rename)
- POJ 2182 Lost Cows (递推)
- HDU1698 Just a Hook 【线段树】+【成段更新】+【lazy标记】
- zoj Friendship 并查集
- [001]今天开始制作自己第一款基于Unity的游戏
- 高精度PSR 恒流PFC控制器QX9931
- Hibernate 4.3.5 hql语句实例
- hdu 1241 Oil Deposits
- uva 11478 最短路径问题(负环,差分约束系统)
- 今天的失望和感悟
- 蛋挞