HDU1698 线段树(区间更新区间查询)
2017-02-14 10:33
363 查看
Just a Hook |
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 31 Accepted Submission(s): 27 |
[align=left]Problem Description[/align] 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. |
[align=left]Input[/align] 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. |
[align=left]Output[/align] 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. |
[align=left]Sample Input[/align]1 10 2 1 5 2 5 9 3 |
[align=left]Sample Output[/align]Case 1: The total value of the hook is 24. |
[align=left]Source[/align] 2008 “Sunline Cup” National Invitational Contest |
大小为n的数组,数组元素初始值为1,有q次操作,x,y,z表示从第x到第y所有的元素的值变为z,最后问这串数的和。
代码:
//基础的线段树模板题 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; typedef long long ll; const int maxn=100005; int t,n,q; ll sum[maxn*4],add[maxn*4]; void pushup(int rt){ sum[rt]=sum[rt<<1]+sum[rt<<1|1]; } void pushdown(int rt,int len){ if(add[rt]){ add[rt<<1]=add[rt]; add[rt<<1|1]=add[rt]; sum[rt<<1]=add[rt]*(len-(len>>1)); sum[rt<<1|1]=add[rt]*(len>>1); add[rt]=0; } } void build(int l,int r,int rt){ add[rt]=0; if(l==r){ //scanf("%I64d",&sum[rt]); sum[rt]=1; return; } int m=(l+r)>>1; build(l,m,rt<<1); build(m+1,r,rt<<1|1); pushup(rt); } void update(int L,int R,int c,int l,int r,int rt){ if(L<=l&&R>=r){ add[rt]=c; sum[rt]=(ll)c*(r-l+1); return; } pushdown(rt,r-l+1); int m=(l+r)>>1; if(L<=m) update(L,R,c,l,m,rt<<1); if(R>m) update(L,R,c,m+1,r,rt<<1|1); pushup(rt); } ll querry(int L,int R,int l,int r,int rt){ if(L<=l&&R>=r) return sum[rt]; pushdown(rt,r-l+1); int m=(l+r)>>1; ll ans=0; if(L<=m) ans+=querry(L,R,l,m,rt<<1); if(R>m) ans+=querry(L,R,m+1,r,rt<<1|1); return ans; } int main() { int x,y,z; scanf("%d",&t); for(int cas=1;cas<=t;cas++){ scanf("%d%d",&n,&q); build(1,n,1); while(q--){ scanf("%d%d%d",&x,&y,&z); update(x,y,z,1,n,1); } printf("Case %d: The total value of the hook is %I64d.\n",cas,querry(1,n,1,n,1)); } }
相关文章推荐
- 几种数据可视化框架分析
- 关于 px pt dp sp dip的介绍
- 在APACHE去除index.php 支持thinkphp和yii
- 如何分析是那个应用导致状态栏消失
- Android Message 及其使用
- 敏捷软件开发笔记
- sql之函数(Function)
- javascript数组(五)
- linux中用top、ps命令查看进程中的线程
- 又断更了。。。为什么呢?
- pyhon模块-3
- Kafka简介
- 使用Picasso加载图片的内存优化实践
- 如何分析按power键熄屏时屏幕又被唤醒了
- POJ 3756 Chess Game 已被翻译
- Poj 3177
- 奔三技术男:聊聊从华为裸辞后的一点感悟(转)
- [半平面交 模板题] BZOJ 3199 [Sdoi2013]escape
- Java编程题练习2017-02-13
- iOS 手机系统升级10.2.1无法链接Xcode8.2.1