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;
} 
版权声明:本文为博主原创文章,未经博主允许不得转载。

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

题目链接:点击打开链接 题意: 输入一个n表示一段长度为n的区间,有n个编号为1~n的点,初始值全部为1。 有q个操作, 每个操作有3个数:l,r,v表示将区间l~r的所有元素修改为v。 求经过q次修...
  • weizhuwyzc000
  • weizhuwyzc000
  • 2016年01月01日 20:24
  • 1602

线段树模板合集--单点替换,区间替换,区间增加3种情况

单点替换,单点增加,区间求最值,区间求和#include #include #include using namespace std; #define lson l , m , rt ...
  • qq547276542
  • qq547276542
  • 2016年05月30日 11:46
  • 3054

非递归线段树区间修改区间求和的两种实现(以POJ 3468为例)

非递归线段树实现区间修改区间求和的两种方法(以 POJ 3468 为例)
  • u012891242
  • u012891242
  • 2015年04月07日 08:37
  • 1495

hdoj 1698 Just a Hook 【线段树区间修改】

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
  • longge33445
  • longge33445
  • 2015年10月29日 21:09
  • 155

HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和

HDU 1698 Just a Hook Time Limit:2000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u ...
  • fans_ac
  • fans_ac
  • 2016年07月28日 00:04
  • 189

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

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...
  • qq_27717967
  • qq_27717967
  • 2016年05月12日 22:17
  • 146

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

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

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

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)...
  • qq_22522375
  • qq_22522375
  • 2015年12月24日 16:37
  • 377

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

hdu1698 Just a Hook (线段树功能:成段替换,总区间求和)
  • u012860063
  • u012860063
  • 2014年06月22日 11:10
  • 1099

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

这道题很经典~~感觉挺有意思,可能是我自己花时间想了好久吧。。 线段树成段更新...
  • liusuangeng
  • liusuangeng
  • 2014年07月15日 15:29
  • 420
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj1698Just a Hook【线段树区间修改+区间求和】
举报原因:
原因补充:

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