HDU 1698 Just a Hook 线段树(区间更新,询问总值)
2015-06-23 19:58
519 查看
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20805 Accepted Submission(s): 10413
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.
Source
2008 “Sunline Cup” National Invitational Contest
写的第一个区间更新的题目 区间更新 询问总值
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 const int maxn=111111; int sum[maxn<<2]; int col[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 v,int l,int r,int rt){ if(L<=l&&r<=R){ col[rt]=v; sum[rt]=(r-l+1)*v; return; } if(col[rt]) PushDown(rt,r-l+1); int m=(l+r)>>1; if(L<=m) update(L,R,v,lson); if(R>m) update(L,R,v,rson); Pushup(rt); } /* int query(int L,int R,int l,int r,int rt){ if(L<=l&&r<=R ) return sum[rt]; int m=(l+r)>>1; int ret=0; if(L<=m)ret=max(ret,query(L,R,lson)); if(R>m) ret=max(ret,query(L,R,rson)); return ret; }*/ int main() { int T , n , m; scanf("%d",&T); for (int cas = 1 ; cas <= T ; cas ++) { 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",cas , sum[1]); } return 0; }
相关文章推荐
- 关于加载动画的总结
- swift入门第三章集合、控制流,标签语句
- mysql自增长联合主键
- Java Web开发模式一(JSP+JavaBean)
- 轻松写好学术论文的方法
- 初学JAVA之基本语句的使用
- C++12.6 static 数据成员、static成员函数
- 如何制作高水准的英文简历
- python基于nginx访问日志统计客户端ip访问量
- 整理ffmpeg 细节分析;
- 图像特征
- 算法小白总结(二)------递归调用
- UVa 11729 Commando War 突击战
- [CF 86D] Powerful array · 莫队算法
- HDU 2795 Billboard 线段树 (单点更新,询问树最左节点是否可以容纳)
- AppIcon中pt的百度百科解释
- HashMap遍历方法
- git 进阶操作
- VC6工程更名
- docstring