HDU-1698 Just a Hook (线段树 区间修改查询)
来源:互联网 发布:什么是编程范式 编辑:程序博客网 时间:2024/06/10 10:57
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36591 Accepted Submission(s): 17853
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 <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define maxn 100001int c[maxn << 2];void pushdown(int o, int l, int r){if(l == r || c[o] == -1) return;c[o << 1] = c[o << 1 | 1] = c[o];c[o] = -1;}void add(int o, int l, int r, int L, int R, int v){pushdown(o, l, r);if(l >= L && r <= R){c[o] = v;return;}int mid = l + r >> 1;if(mid >= L) add(o << 1, l, mid, L, R, v);if(mid < R) add(o << 1 | 1, mid + 1, r, L, R, v);}int query(int o, int l, int r){if(l == r) return c[o];pushdown(o, l, r);int ans = 0, mid = l + r >> 1;ans += query(o << 1, l, mid);ans += query(o << 1 | 1, mid + 1, r);return ans;}void build(int o, int l, int r){c[o] = -1;if(l == r) return;int mid = l + r >> 1;build(o << 1, l, mid);build(o << 1 | 1, mid + 1, r);}int main(){int T, n, casenum = 1;scanf("%d", &T);while(T--){scanf("%d", &n);build(1, 1, n);add(1, 1, n, 1, n, 1);int q, l, r, v;scanf("%d", &q);while(q--){scanf("%d %d %d", &l, &r, &v);add(1, 1, n, l, r, v);}printf("Case %d: The total value of the hook is %d.\n", casenum++, query(1, 1, n));}}/*题意:1e5个数,1e5次操作,某区间内的数都改为v,最后询问所有数的和。思路:线段树区间修改查询。基本题。*/
阅读全文
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 (线段树,区间修改)
- HDU - 1698 Just a Hook (线段树区间修改)
- HDU ACM 1698 Just a Hook->线段树+区间修改
- HDU 1698 Just a Hook (线段树区间修改)
- HDU 1698 Just a Hook(线段树区间修改)
- hdu 1698Just a Hook(线段树区间修改)
- (HDU 1698)Just a Hook 线段树区间修改
- HDU 1698 Just a Hook【线段树】区间修改,查询总和
- 【hdu】Just a Hook(线段树区间修改)
- hdu 1684 Just a Hook 线段树-区间修改
- HDU 1689 Just a Hook (线段树, 区间修改)
- HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和
- HDU 1698 Just a Hook(线段树:区间set,区间查询)
- HDU 1698 Just a Hook(线段树:区间set,区间查询)
- Leetcode:Hamming Distance一些小结
- Mock.js使用
- 共同学习Java源代码-数据结构-HashMap(十八)
- qrcode将生成的二维码转成img格式
- ubuntu 16.04 64bits 交叉编译openssl到arm-linux
- HDU-1698 Just a Hook (线段树 区间修改查询)
- aidl
- 生活随笔
- Failed to read artifact descriptor
- POJ 3617 Best Cow Line
- Web 建站技术网上资料收集
- 条款06:对于不希望自动生成的函数就应该明确拒绝他
- dos命令下执行命令报错 错误:程序包org.dom4j.jar不存在 错误:找不到符号处理
- SIFT尺度不变特征变换匹配算法