hdu 1698
来源:互联网 发布:淘宝店铺首页视频代码 编辑:程序博客网 时间:2024/06/07 22:42
A -Just a Hook
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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.
区间替换,区间求和。
代码如下:
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define maxn 111111struct Tree{ int l,r; int num,lazy;}tree[maxn<<2];void PushUp(int rt){ tree[rt].num=tree[rt<<1].num+tree[rt<<1|1].num;}void PushDown(int rt){ if(tree[rt].lazy){ tree[rt<<1].num=tree[rt].lazy*(tree[rt<<1].r-tree[rt<<1].l+1); tree[rt<<1|1].num=tree[rt].lazy*(tree[rt<<1|1].r-tree[rt<<1|1].l+1); tree[rt<<1].lazy=tree[rt<<1|1].lazy=tree[rt].lazy; tree[rt].lazy=0; }}void build(int l,int r,int rt){ tree[rt].l=l; tree[rt].r=r; tree[rt].lazy=0; if(l==r){ tree[rt].num=1; return ; } int m=(l+r)>>1; build(lson); build(rson); PushUp(rt);}void update(int x,int y,int val,int rt){ int l,r; l=tree[rt].l; r=tree[rt].r; if(l==x&&r==y){ tree[rt].lazy=val; tree[rt].num=val*(tree[rt].r-tree[rt].l+1); return ; } PushDown(rt); int m=(l+r)>>1; if(x<=m) update(x,min(y,m),val,rt<<1); if(y>m) update(max(m+1,x),y,val,rt<<1|1); PushUp(rt);}int main(){ int T,n,m; cin>>T; for(int cas=1;cas<=T;cas++) { scanf("%d%d",&n,&m); build(1,n,1); while(m--) { int a,b,c; scanf("%d%d%d",&a,&b,&c); update(a,b,c,1); } printf("Case %d: The total value of the hook is %d.\n",cas,tree[1].num); } return 0;}
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- HDU 1698
- HDU 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu 1698
- hdu-1698
- hdu 1698
- HDU 1698
- hdu1573-X问题
- ARM1176JZF-S 体系结构之寄存器和操作模式
- 为什么要对url进行encode
- CGAL库
- 模式匹配的几种算法(含KMP算法)
- hdu 1698
- AP Invoice创建会计科目脚本
- Contest - 2013校赛暨华中邀请赛 Problem D: Tetrahedron Inequality
- POJ 1195 Open the Lock
- 博弈入门必备知识&&入门题 hdu1846 HDU1847 HDU1527 hdu2516 HDU1849 HDU1848 HDU1907
- 计算日期
- eclisp汉化教程
- 指针的低级错误!铭记!
- 现在编程语言还重要吗?