hdoj1698Just a Hook【线段树区间修改+区间求和】

原创 2015年11月18日 13:35:08



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.
 

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
 

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using 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;
} 
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj 1698 Just a Hook -- (线段树,区间值修改,区间求和)

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

hdu 1698 Just a Hook(线段树 成段更新+总区间求和)

http://acm.hdu.edu.cn/showproblem.php?pid=1698 题意:给定一根棒的长度,它上面有价值1,2,3种,初始价值为1,每次输入的x,y,z表示把区间[x,y]的...

hdu1698 Just a Hook (线段树功能:成段替换,总区间求和)

hdu1698 Just a Hook (线段树功能:成段替换,总区间求和)

hdu 1698 Just a hook 线段树 成段更新~~区间求和

这道题很经典~~感觉挺有意思,可能是我自己花时间想了好久吧。。 线段树成段更新

hdoj 1698 Just a Hook 【线段树 区间更新】

题目大意:有一段链子,初始的时候是铜的(价值为1),n代表有n段(1~n),输入a, b, c三个数分别表示将从a到b的链子的价值改为c, 最后问你经过多次改变之后的总价值。 策略:这道题是简单的线...

HDU 1698 Just a Hook (线段树区间修改)

在Dota里面有个角色叫屠夫,他的武器是 Meat Hook,对所有的英雄都有着致命的威胁, Meat Hook 由一系列连续金属构成(假设有N块金属),金属有 铜 ,银 ,金 三种,分别对应价值 1...

hdu_1698Just a Hook线段树_区间修改

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

杭电 1698 Just a Hook(线段树区间修改)

http://acm.hdu.edu.cn/showproblem.php?pid=1698 Just a Hook Time Limit: 4000/2000 MS (Java/Others...

HDU 1698 Just a Hook (线段树区间更新)

HDU 1698 Just a Hook (线段树 区间更新基础)

HDU 1698 Just a hook (线段树区间更新)

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)