hdu1698 Just a Hook
来源:互联网 发布:微盘软件开发 编辑:程序博客网 时间:2024/05/21 14:19
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14180 Accepted Submission(s): 7027
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
水线段树,对区间进行set操作
#include<cstdio>#include<iostream>#include<cstring>using namespace std;int sum[444444],setv[444444];int n,m,ans;void build(int o,int l,int r){ if (l==r) { sum[o]=1; return; } int mid=(l+r)>>1; build (o*2 ,l,mid); build (o*2+1,mid+1,r); sum[o]=sum[o*2]+sum[o*2+1];}void pushdown(int o,int l,int r){ if (setv[o]>=0) { setv[o*2]=setv[o]; setv[o*2+1]=setv[o]; setv[o]=-1; }}void maintain(int o,int l,int r){ if (r>l) { int mid=(l+r)>>1; if (setv[o*2]>=0) sum[o*2]=setv[o*2]*(mid-l+1); if (setv[o*2+1]>=0) sum[o*2+1]=setv[o*2+1]*(r-mid); sum[o]= sum[o*2]+sum[o*2+1]; }}void update(int o,int l,int r,int x,int y, int z){ if (x<=l&&r<=y) { setv[o]=z; sum[o]=setv[o]*(r-l+1); } else { pushdown(o,l,r); int mid=(l+r)>>1; if (x<=mid) update(o*2, l, mid, x, y, z); else maintain(2*o,l,mid); if (y>mid) update(o*2+1, mid+1,r, x, y, z); else maintain(2*o+1,mid+1,r); maintain(o,l,r); }}void query(int o,int l,int r,int x,int y ){ if (setv[o]>=0) ans+= setv[o]*( min(y,r)- max(l,x) +1 ); else if ( x<=l&&r<=y ) { ans+= sum[o]; } else { int mid=(l+r)>>1; if (x<=mid) query(o*2, l,mid, x, y ); if (y>mid) query(o*2+1, mid+1,r, x, y); }}int main(){ int T,cas=1; scanf("%d",&T); while (T--) { scanf("%d",&n); memset(setv,-1,sizeof(setv)); build (1,1,n); scanf("%d",&m); while (m--) { int x,y,z; scanf("%d%d%d",&x,&y,&z); update( 1, 1, n ,x, y, z); } ans=0; query(1,1,n,1,n); printf("Case %d: The total value of the hook is %d.\n",cas++,ans); } return 0;}
0 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
- Javascript获取IFrame内容(兼容IE&FF)
- oracle11g远程登录设置方法
- 字符串操作-串的存储结构、赋值、串长、子串、匹配...
- 【ftp】725本电子书下载
- 150。3 - sort List- AC
- hdu1698 Just a Hook
- 经停、联程
- JAVA多线程和并发基础面试问答
- SDK,jdk与jre的区别
- Rachel_Zhang机器学习十篇网络博文链接
- 菜刀连接postgresql数据库
- Android 手机麦克风PCM 格式 到 ULAW的转换
- 批量删除
- 抽象类小结