HDU 1698 - Just a Hook(线段树区间更新)
2016-12-07 21:35
543 查看
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 29437 Accepted Submission(s): 14545
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.
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.
题意:
给出一个区间,1-n,起始的每个点权值都为1。
给出若干次区间更新,求最后的区间的和。
解题思路:
模板。
AC代码:
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 29437 Accepted Submission(s): 14545
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.
题意:
给出一个区间,1-n,起始的每个点权值都为1。
给出若干次区间更新,求最后的区间的和。
解题思路:
模板。
AC代码:
#include<stdio.h> #define lson l,mid,rt<<1 #define rson mid+1,r,rt<<1|1 const int maxn = 1e5+5; long long add[maxn<<2]; long long sum[maxn<<2]; void PushUp(int rt) {sum[rt] = sum[rt<<1]+sum[rt<<1|1];} void PushDown(int rt,int m) { if(add[rt]) { add[rt<<1] = add[rt]; add[rt<<1|1] = add[rt]; sum[rt<<1] = add[rt]*(m-(m>>1)); sum[rt<<1|1] = add[rt]*(m>>1); add[rt] = 0; } } void Update(int L,int R,int c,int l,int r,int rt) { if(L <= l && R >= r) { add[rt] = c; sum[rt] = c*(r-l+1); return ; } PushDown(rt,r-l+1); int mid = (l+r)>>1; if(L <= mid) Update(L,R,c,lson); if(R > mid) Update(L,R,c,rson); PushUp(rt); } void build(int l,int r,int rt) { add[rt] = 0; if(l == r) { sum[rt] = 1; return ; } int mid = (l+r)>>1; build(lson); build(rson); PushUp(rt); } int main() { int T; scanf("%d",&T); int flag = 1; while(T--) { int n; scanf("%d",&n); build(1,n,1); int loop; scanf("%d",&loop); while(loop--) { int L,R,c; scanf("%d%d%d",&L,&R,&c); Update(L,R,c,1,n,1); } printf("Case %d: The total value of the hook is %lld.\n",flag++,sum[1]); } return 0; }
相关文章推荐
- buddy算法实现
- [zjoi2004]嗅探器
- java环境搭建系列:JDK环境变量详细配置
- 希望式管理和绝望式管理
- 第一个struts案例及分析
- mongodb改表名字
- Swift中的get和set方法
- kubernetes1.4简介和安装部署
- HTML:常见的元素
- 把文件里的sql文件按从高到下的顺序导进数据库
- 【罗宾欺诈者】回环符文——回文树(回文自动机)
- eclipse 有关svn的操作(svn插件安装,svn检索项目,)
- JavaSE学习(6) 面向对象类和对象(5)抽象类、接口、final
- [MySQL性能优化系列]提高缓存命中率
- LeetCode-Array-27 Remove Element
- NodeJS第一天
- 【工作记录】模拟实现“实时监控网速”之思路与实现
- (3)元素
- PR:Image Co-segmentation Using Maximum Common Subgraph Matching and Region Co-growing
- [MySQL性能优化系列]LIMIT语句优化