HDU1698 Just a Hook 解题报告--线段树
2013-08-08 20:05
239 查看
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12898 Accepted Submission(s): 6417
[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
[align=left]Recommend[/align]
wangye
#include <iostream> using namespace std; #define lson L,m,rt<<1 #define rson m+1,R,rt<<1|1 int sum[100000<<2]; int cor[100000<<2]; void PushDown(int rt,int m) { if(cor[rt]) { cor[rt<<1]=cor[rt<<1|1]=cor[rt]; sum[rt<<1]=(m-(m>>1))*cor[rt]; sum[rt<<1|1]=(m>>1)*cor[rt]; cor[rt]=0; } } void build(int L,int R,int rt) { sum[rt]=1;cor[rt]=0; if (L==R) return; int m=(L+R)>>1; build(lson); build(rson); sum[rt]=sum[rt<<1]+sum[rt<<1|1]; return; } void update(int l,int r,int up,int L,int R,int rt) { if (l<=L&&r>=R) { cor[rt]=up; sum[rt]=up*(R-L+1); return; } PushDown(rt,R-L+1); int m=(L+R)>>1; if (l<=m) update(l,r,up,lson); if (r>m) update(l,r,up,rson); sum[rt]=sum[rt<<1]+sum[rt<<1|1]; } int main() { int r,c=0;; scanf("%d",&r); while(r--) { c++; int n; scanf("%d",&n); build(1,n,1); int m; scanf("%d",&m); 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",c,sum[1]); } return 0; }
相关文章推荐
- hdu1698 Just a Hook 解题报告
- 【解题报告】 HDU 1698 Just a Hook 线段树 (线段替换) 插线问线 + 延时标记
- hdu1698 Just a Hook(线段树)
- HDU1698关于线段树的解题报告和代码
- hdu1698 Just a Hook(线段树 区间更新+懒惰标记)
- HDU1698_Just a Hook(线段树/成段更新)
- 【线段树成段更新-模板】【HDU1698】Just a Hook
- 线段树之HDU1698 Just a Hook
- HDU1698 Just a Hook--线段树LAZY操作
- 【线段树成段更新-模板】【HDU1698】Just a Hook
- hdu1698 Just a Hook (线段树)
- hdu1698 Just a Hook(线段树区间修改)
- HDU1698 Just a Hook(线段树成段替换、区间求和,延迟标记的应用)
- hdu1698 Just a Hook(线段树区间修改)
- [线段树]hdu1698 Just a Hook(区间更新、延迟标记
- hdu1698-Just a Hook (线段树区间更新)(延迟标记)
- hdu1698 Just a Hook(线段树成段更新lazy)
- HDU1698:Just a Hook(线段树区间更新)
- hdu1698 Just a Hook (线段树区间修改)
- Just a Hook(HDU1698 线段树的简单应用)