HDU1698 Just a Hook_线段树
来源:互联网 发布:手机直播辅助软件 编辑:程序博客网 时间:2024/06/03 23:40
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33719 Accepted Submission(s): 16464
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.
#include<bits/stdc++.h>#define mid ((l+r)/2)#define lson rt<<1,l,mid#define rson rt<<1|1,mid+1,rconst int maxn=100000+10;int i,j,k,m,n,a[maxn<<2],t,x,y,c,ans;void color(int rt,int l,int r,int L,int R,int c){if (L<=l && r<=R){a[rt]=c;}else {if (a[rt]>0) {a[rt<<1]=a[rt<<1|1]=a[rt];a[rt]=-1;}if (L<=mid) color(lson,L,R,c);if (mid+1<=R) color(rson,L,R,c);}}void calc(int rt,int l,int r){if (a[rt]>0) ans+=(r-l+1)*a[rt];else {calc(lson);calc(rson);}}int main(){scanf("%d",&t);for (i=1;i<=t;i++){scanf("%d%d",&n,&m);a[1]=1;for (j=1;j<=m;j++){scanf("%d%d%d",&x,&y,&c);color(1,1,n,x,y,c);}ans=0;calc(1,1,n);printf("Case %d: The total value of the hook is %d.\n",i,ans);}return 0;}
阅读全文
0 0
- HDU1698 Just a Hook_线段树
- hdu 1698 Just a Hook_线段树
- 【线段树】 hdu1698 Just a Hook
- Just a Hook(hdu1698,线段树)
- 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--线段树区间更新
- HDU1698 Just a Hook 解题报告--线段树
- HDU1698:Just a Hook(线段树区间更新)
- hdu1698 Just a Hook 线段树,成段更新
- 分布式架构真正适用于大型互联网项目的架构 dubbo+zookeeper+springmvc+mybatis+shiro+redis
- SpringMVC4.3x教程之七国际化的三种实现详解
- Linux服务器--I/O复用(select、poll、epoll)
- PHP 循环 之 While 循环方法的使用
- 1976-函数训练之被甩
- HDU1698 Just a Hook_线段树
- BW:传输到Open Hub的DTP,怎么删除?
- Android常用网站
- keras 画训练过程曲线
- 培训班出身的程序员为什么遭人嫌弃
- shell 脚本编程之函数
- 实现数据一行展示不换行,不出滚动条
- 掌握Angular2的依赖注入
- input【file】限制上传图片数量