hdu 1698__Just a Hook(区间求和,成段更新)
来源:互联网 发布:怎样才能成为网络写手 编辑:程序博客网 时间:2024/06/06 10:07
链接:Just a Hook
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22783 Accepted Submission(s): 11393
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.
代码如下:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn = 100000 + 10;int sum[maxn << 2], color[maxn << 2];void Pushdown(int rt, int m){ if(color[rt]) { color[rt << 1] = color[rt]; color[rt << 1 | 1] = color[rt]; sum[rt << 1] = color[rt] * (m - (m >> 1)); sum[rt << 1 | 1] = color[rt] * (m >> 1); color[rt] = 0; }}void Pushup(int rt){ sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];}void build(int l, int r, int rt){ color[rt] = 0; //初始化数组color if(l == r) { sum[rt] = 1; return ; } int m = (l + r) >> 1; build(lson); build(rson); Pushup(rt);}void update(int L, int R, int c, int l, int r, int rt) { //此处用到了lazy的思想,一旦找到了,就不再向下更新直接return if(L <= l && r <= R) { color[rt] = c; //当前结点的color改成c sum[rt] = c * (r - l + 1); //当前结点所代表的区间的和 return ; } Pushdown(rt, r - l + 1); //向下更新sum与color数组 int m = (l + r) >> 1; if(L <= m) { update(L, R, c, lson); } if(R > m) { update(L, R, c, rson); } Pushup(rt); //更新当前结点的sum}int main(){ int T, n, q, a, b, c; int cas = 1; scanf("%d", &T); while(T--) { 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++, sum[1]); } return 0;}
0 0
- hdu 1698__Just a Hook(区间求和,成段更新)
- hdu 1698 Just a Hook(线段树 成段更新+总区间求和)
- hdu 1698 Just a hook 线段树 成段更新~~区间求和
- hdu 1698 Just a Hook (成段更新+总区间求和)
- hdu(1698)——Just a Hook(成段更新,节点求和,lazy思想)
- hdu 1698 Just a Hook(线段树区间更新求和)
- HDU 1698 Just a Hook 线段树区间更新求和
- HDU 1698 Just a Hook(线段树区间更新+区间求和+染色问题)
- HDU 1698 JUST a hook (线段树 成段替换 区间求和 延迟标记)
- hdu 1698 Just a Hook(线段树的区间更新及求和)
- hdu 1698 Just a Hook(成段更新)
- hdu 1698 Just a Hook(成段更新)
- HDU 1698 Just a Hook(成段更新)
- hdu 1698 Just a Hook(成段更新)
- 线段树 段更新 HDU 1698 Just a Hook (线段树区间修改)
- HDU 1689 Just a Hook 线段树区间更新求和
- 成段改A为B更新区间求和 hdu 1698 Just a Hook
- hdu 1698 Just a Hook 区间修改,区间求和
- TI M4看门狗watchdog使用
- Codeforces 437C The Child and Toy( 贪心)
- STL 优先队列 定义 优先级
- uva 11549 Calculator Conundrum(floyd判圈)
- Android面试过程描述
- hdu 1698__Just a Hook(区间求和,成段更新)
- Unix - ls命令的简要实现
- uboot使用loady命令进行串口传输
- codeforces #316
- Android中的Selector的用法
- hibernate 级联查询
- Hive内部表与外部表区别,数据导入与数据读取方式小结
- java设计模式----模板模式
- tab标签页切换