hdoj1698Just a Hook【线段树区间修改+区间求和】
来源:互联网 发布:如何把域名卖出去 编辑:程序博客网 时间:2024/06/03 04:05
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24101 Accepted Submission(s): 12062
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
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#define lson l,mid,rt<<1#define rson mid+1,r,rt<<1|1using namespace std;const int maxn=100010;int sum[maxn<<2];int add[maxn<<2];void pushup(int rt){sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void pushdown(int l,int r,int rt){if(add[rt]){int mid=(l+r)>>1;sum[rt<<1]=add[rt]*(mid-l+1);sum[rt<<1|1]=add[rt]*(r-mid);add[rt<<1]=add[rt];add[rt<<1|1]=add[rt];add[rt]=0;}}void update(int left,int right,int k,int l,int r,int rt){if(left<=l&&r<=right){add[rt]=k;sum[rt]=k*(r-l+1);return ;}int mid=(l+r)>>1;pushdown(l,r,rt);if(left<=mid)update(left,right,k,lson);if(right>mid)update(left,right,k,rson);pushup(rt);}int query(int left,int right,int l,int r,int rt){if(l>right||r<left)return 0;if(left<=l&&r<=right)return sum[rt];int mid=(l+r)>>1;pushdown(l,r,rt);return query(left,right,lson)+query(left,right,rson);}int main(){int t,i,j,k=1,n,q;scanf("%d",&t);while(t--){scanf("%d%d",&n,&q);int a,b,c;memset(add,0,sizeof(add));update(1,n,1,1,n,1);while(q--){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",k++,query(1,n,1,n,1));}return 0;}
0 0
- hdoj1698Just a Hook【线段树区间修改+区间求和】
- Just a Hook ,线段树,区间更新 ,区间求和
- poj 1698 Just a Hook -- (线段树,区间值修改,区间求和)
- HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和
- HDU 1689 Just a Hook 线段树区间更新求和
- hdoj 1689 Just a Hook 【线段树区间更新求和】
- hdu 1698 Just a Hook(线段树区间更新求和)
- HDU 1698 Just a Hook 线段树区间更新求和
- Just a Hook 【线段树】-区间更改 求和
- 线段树(区间修改,区间求和)
- codevs1080 线段树(区间修改+区间求和
- hdu 1698 Just a Hook 区间修改,区间求和
- 20140719 「线段树 - 区间替换,区间求和」 HDOJ 1698 Just a Hook
- 线段树—Just a Hook(区间更新,区间求和)
- HDU 1698 Just a Hook(线段树区间更新+区间求和+染色问题)
- 【线段树】区间求和+区间修改(区间加)
- HDU 1698 Just A Hook (线段树,区间修改)
- HDU - 1698 Just a Hook (线段树区间修改)
- 线程
- android之Service介绍之三 AIDL与传递对象
- 不忘初心,方得始终
- [LeetCode]Add Binary&Climbing Stairs&Remove Duplicates from Sorted List
- 十进制小数转化为二进制小数
- hdoj1698Just a Hook【线段树区间修改+区间求和】
- C语言中产生随机数
- 第十周练习 1003 素数判定
- ArcGIS教程:了解路径距离分析(一)
- JAVA--HashCode 基础(判断对象是否相等)
- linux中环境变量的设置
- z10刷机
- 数据表表名或字段名为SQL关键字时Hibernate解决方案
- 【JSP开发】有关session的登录注销的一个小例子