HDU 1698 Just a Hook【线段树】区间修改,查询总和
来源:互联网 发布:windows 7 安装.net 编辑:程序博客网 时间:2024/06/06 16:44
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24149 Accepted Submission(s): 12076
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.
昨天晚上a掉的,按着感觉来的......
就和区间加减一样的处理,然后今天比较忙,抽空出来贴一下,也是真忙了.....
加油!
#include<stdio.h>#include<string.h>int set[400005],sum[400005];void pushdown(int rt,int len){ if(set[rt]) { int tp=rt<<1,tl=len>>1; set[tp]=set[rt];set[tp|1]=set[rt]; sum[tp]=set[rt]*(len-tl); sum[tp|1]=set[rt]*tl; set[rt]=0; }}void build(int rt,int l,int r){ set[rt]=0; if(l==r) { sum[rt]=1; return; } int mid=(l+r)>>1,tp=rt<<1; build(tp,l,mid);build(tp|1,mid+1,r); sum[rt]=sum[tp]+sum[tp|1];}void update(int rt,int l,int r,int a,int b,int c){ if(l>=a&&r<=b) { set[rt]=c; sum[rt]=c*(r-l+1); return; } pushdown(rt,r-l+1); int mid=(l+r)>>1,tp=rt<<1; if(mid>=a) { update(tp,l,mid,a,b,c); } if(mid<b) { update(tp|1,mid+1,r,a,b,c); } sum[rt]=sum[tp]+sum[tp|1];}int main(){ int t;// freopen("shuju.txt","r",stdin); scanf("%d",&t); for(int k=1;k<=t;++k) { int n,m; scanf("%d%d",&n,&m); build(1,1,n); for(int i=0;i<m;++i) { int a,b,c; scanf("%d%d%d",&a,&b,&c); update(1,1,n,a,b,c); } printf("Case %d: The total value of the hook is %d.\n",k,sum[1]); } return 0;}
0 0
- HDU 1698 Just a Hook【线段树】区间修改,查询总和
- HDU-1698 Just a Hook (线段树 区间修改查询)
- 线段树系列-hdu-1698-Just a Hook-区间修改求总和
- HDU 1698 Just a Hook(线段树-区间修改|区间查询)
- HDU 1698 Just a Hook (线段树:区间修改+区间查询)
- HDU-1698-Just A Hook (线段树区间修改,区间查询)
- HDU 1698 Just A Hook (线段树,区间修改)
- HDU - 1698 Just a Hook (线段树区间修改)
- HDU ACM 1698 Just a Hook->线段树+区间修改
- HDU 1698 Just a Hook (线段树区间修改)
- HDU 1698 Just a Hook(线段树区间修改)
- hdu 1698Just a Hook(线段树区间修改)
- (HDU 1698)Just a Hook 线段树区间修改
- HDU.1689 Just a Hook (线段树 区间替换 区间总和)
- 【hdu】Just a Hook(线段树区间修改)
- hdu 1684 Just a Hook 线段树-区间修改
- HDU 1689 Just a Hook (线段树, 区间修改)
- HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和
- Kalman滤波小结
- Linux Advance--从一道题谈linux下fork的运行机制
- Python小函数
- 学习随记(二)
- flash buidler 4.7 真机调试
- HDU 1698 Just a Hook【线段树】区间修改,查询总和
- 栈--最终版
- hihocoder 1014 trie树
- PAT-PAT (Advanced Level) PractiseBe Unique (20) 【一星级】
- JAVA编码问题
- Java发送邮件
- Android 多线程及多线程中更新控件。
- 启发式搜索A * 算法
- 2015 重庆市赛 解题报告