博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
hdu 1698
阅读量:4705 次
发布时间:2019-06-10

本文共 3207 字,大约阅读时间需要 10 分钟。

Just a Hook

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16563    Accepted Submission(s): 8234


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.
 

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.
 

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
 
1 10 2 1 5 2 5 9 3
 

Sample Output
 
Case 1: The total value of the hook is 24.
 

Source
 

AC代码:
#include
using namespace std;struct Node{ int left,right; int s;}a[400010];void built(int cur,int x,int y){ a[cur].left=x; a[cur].right=y; a[cur].s=1; if(x
>1; built(cur<<1,x,mid); built(cur<<1 | 1,mid+1,y); }}void insert(int val,int cur,int x,int y){ if(a[cur].left==x && a[cur].right==y){ a[cur].s=val; return ; } if(a[cur].left==a[cur].right){ a[cur].s=val; return ; } if(a[cur].s){ a[cur<<1].s=a[cur<<1 | 1].s=a[cur].s; a[cur].s=0; } int mid=(a[cur].right+a[cur].left)>>1; if(y<=mid) insert(val,cur<<1,x,y); else if(x>mid) insert(val,cur<<1 |1,x,y); else{ insert(val,cur<<1,x,mid); insert(val,cur<<1 | 1,mid+1,y); }}int sum(int cur,int x,int y){ if(a[cur].s){ //cout<
<<' '<
<<' '<
<
>1; return sum(cur<<1,x,mid)+sum(cur<<1 |1,mid+1,y);}int main(){ int T; cin>>T; for(int j=1;j<=T;j++){ int n; cin>>n; built(1,1,n); int t; cin>>t; for(int i=0;i
>x>>y>>val; insert(val,1,x,y); } cout<<"Case "<
<<": The total value of the hook is "<
<<'.'<

转载于:https://www.cnblogs.com/mengfanrong/p/4565959.html

你可能感兴趣的文章
不把DB放进容器的理由
查看>>
OnePage收集
查看>>
Java parseInt()方法
查看>>
yahoo的30条优化规则
查看>>
[CCF2015.09]题解
查看>>
[NYIST15]括号匹配(二)(区间dp)
查看>>
json_value.cpp : fatal error C1083: 无法打开编译器生成的文件:No such file or directory
查看>>
洛谷 P1101 单词方阵
查看>>
Swift DispatchQueue
查看>>
C#和JAVA 访问修饰符
查看>>
小甲鱼OD学习第1讲
查看>>
HDU-1085 Holding Bin-Laden Captive-母函数
查看>>
php提示undefined index的几种解决方法
查看>>
LRJ
查看>>
Struts2环境搭建
查看>>
Linux: Check version info
查看>>
stl学习之测试stlen,cout等的运行速度
查看>>
魔戒三曲,黑暗散去;人皇加冕,光明归来
查看>>
Error和Exception
查看>>
Python和Singleton (单件)模式[转载]
查看>>