hdu1698 Just a Hook
来源:互联网 发布:数组和指针的区别 编辑:程序博客网 时间:2024/04/30 10:47
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8373 Accepted Submission(s): 4051
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.
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.
Source
2008 “Sunline Cup” National Invitational Contest
Recommend
wangye
额,简单的线段树应用,加个lazy标记即可。
#include <stdio.h>#include <algorithm>using namespace std;typedef struct{ int l,r,num,lazy;}Tree;Tree tree[500005];void Build(int t,int l,int r){ int mid; tree[t].l=l; tree[t].r=r; tree[t].num=r-l+1; tree[t].lazy=1; if (l==r) return; mid=(l+r)/2; Build(2*t+1,l,mid); Build(2*t+2,mid+1,r);}void Add(int t,int x,int y,int c){ int mid,l,r; l=tree[t].l; r=tree[t].r; if (l==x && r==y) { tree[t].lazy=1; tree[t].num=(r-l+1)*c; return; } mid=(l+r)/2; if (tree[t].lazy==1) { tree[t].lazy=0; Add(2*t+1,l,mid,tree[t].num/(r-l+1)); Add(2*t+2,mid+1,r,tree[t].num/(r-l+1)); } if (x<=mid) Add(2*t+1,x,min(mid,y),c); if (y>mid) Add(2*t+2,max(mid+1,x),y,c); tree[t].num=tree[2*t+1].num+tree[2*t+2].num;}int Find(int t){ if (tree[t].lazy==1) return tree[t].num; return Find(2*t+1)+Find(2*t+2);}int main(){ int i,j,n,T,m,x,y,c,cnt=1; scanf("%d",&T); while(T--) { scanf("%d",&n); Build(0,0,n-1); scanf("%d",&m); while(m--) { scanf("%d%d%d",&x,&y,&c); Add(0,x-1,y-1,c); } printf("Case %d: The total value of the hook is %d.\n",cnt++,Find(0)); } return 0;}
- 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
- hdu1698-Just a Hook
- hdu1698 Just a Hook
- Just a Hook hdu1698
- 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
- 创业公司: 首席产品设计师的最低要求
- iPhone、iPad开发之图片资源管理
- style.left 与 style.top 在 IE和FireFox的兼容问题
- Ubuntu12.04 安装与卸载jdk1.6
- 关于在内部类中启动一个Android Intent的疑惑
- hdu1698 Just a Hook
- cocoa下的扩展日志输出例程
- php100视频之Ajax+PHP快速上手及应用(一)【第48讲】
- 用Autohotkey实现分屏
- linux内核下载地址
- 使用进度条显示后台执行进度的方法
- 容器与继承
- 多个Filter 的执行顺序
- 删除TFS项目