HDOJ1698 Just a Hook(线段树)
来源:互联网 发布:饥荒 知乎 编辑:程序博客网 时间:2024/06/16 12:23
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.
![](http://acm.hdu.edu.cn/data/images/C116-1010-1.JPG)
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.
区间更新
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;#define lson l, m, rt << 1#define rson m + 1, r, rt << 1 | 1const int maxn = 100005;int h, w, n, col[maxn << 2], 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 update(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) update(L, R, c, lson);if(R > m) update(L, R, c, rson);pushup(rt);}int main(int argc, char const *argv[]){int t;scanf("%d", &t);for(int i = 1; i <= t; ++i) {int n, m;scanf("%d%d", &n, &m);build(1, n, 1);while(m--) {int a, b, c;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", i, sum[1]);}return 0;}
1 0
- 线段树:HDOJ1698 Just a Hook
- HDOJ1698 Just a Hook(线段树)
- Just a Hook(线段树)
- 线段树 Just a Hook
- 线段树 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 线段树
- 【线段树】 hdu1698 Just a Hook
- hdu Just a Hook (线段树)
- hdoj 1698 Just a Hook 【线段树】
- Just a Hook+线段树更新
- HDU 1698 Just a Hook(线段树)
- HDU 1698 just a hook 线段树
- HDU 1698 Just a Hook(线段树)
- Just a Hook(hdu1698,线段树)
- 剑指Offer——面试小提示(持续更新中)
- springMVC MultipartFile file文件上传及参数接受
- Codeforces Round #130 (Div. 2) A. Dubstep(STL做法)
- 黑马程序员——其他6:枚举
- 读写锁
- HDOJ1698 Just a Hook(线段树)
- Java序列化基础
- sed高级用法:模式空间(pattern space)和保持空间(hold space)
- 分治法求众数问题 (配图)
- 10进制数转16位2进制补码
- iOS应用内部切换语言,不跟随系统
- iOS 宏(define)与常量(const)的正确使用
- TCP三次握手及其背后的缺陷
- linux系统启动