HDU1698 线段树

原创 2016年06月02日 00:33:26

Just a Hook

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


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.
 

区间求和的问题,很显然用线段树。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn = 100000 + 10;

int n, sum;

struct node
{
	int l, r, n;
} a[maxn << 2];

void init(int l, int r, int i)
{
	a[i].l = l;
	a[i].r = r;
	a[i].n = 1;
	if (l != r)
	{
		int mid = (l + r) >> 1;
		init(l, mid, 2 * i);
		init(mid + 1, r, 2 * i + 1);
	}
}

void insert(int i, int x, int y, int m)
{
	if (a[i].n == m)//相同则不用修改了
		return;
	if (a[i].l == x && a[i].r == y)//找到了区间,直接更新
	{
		a[i].n = m;
		return;
	}
	if (a[i].n != -1)//如果该区间只有一种颜色
	{
		a[2 * i].n = a[2 * i + 1].n = a[i].n;//由于后面必定对子树操作,所以更新子树的值等于父亲的值
		a[i].n = -1;//由于该区域颜色与修改不同,而且不是给定区域,所以该区域必定为杂色
	}
	//父区间为杂色时对所有子节点进行操作
	int mid = (a[i].l + a[i].r) >> 1;
	if (x>mid)
		insert(2 * i + 1, x, y, m);
	else if (y <= mid)
		insert(2 * i, x, y, m);
	else
	{
		insert(2 * i, x, mid, m);
		insert(2 * i + 1, mid + 1, y, m);
	}
}

int find(int i)//区间求和
{
	if (a[i].n != -1)//纯色直接算这个区间
		return (a[i].r - a[i].l + 1)*a[i].n;
	else//不存则左右子树去找
		return find(i * 2) + find(i * 2 + 1);
}

int main()
{
	int t, i, k, x, y, m;
	int cas = 1;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d%d", &n, &k);
		init(1, n, 1);
		while (k--)
		{
			scanf("%d%d%d", &x, &y, &m);
			insert(1, x, y, m);
		}
		printf("Case %d: The total value of the hook is %d.\n", cas++, find(1));
	}

	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU.1698 屠夫(线段树成段更新大大大水题)

题目大意:T组测试,每组n个数,

HDU 1698 Just a Hook 线段树

题意:一条长链子上面有许多钩子,一次编号 1 - n ,每个钩子有金银铜三种材质(3,2,1),假设一开始全是铜质的,每次操作可以将 x - y 范围内的钩子变成 z 材质.求最后整条链子的值。 题...
  • Tsaid
  • Tsaid
  • 2011-09-01 10:45
  • 581

HDU1698 Just a Hook 线段树入门题复习

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

HDU 1698 Just a hook 线段树(段更新,段询问)

In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. T...

hdu1698just a hook 线段树

懒惰标记的入门题== 讲解详见小伙伴的博客 点击打开链接 貌似只是加了注释== 我的代码->俩人改了好久才过==注意.L L  .R R的区别 #include #include #inclu...

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

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

HDU-1698 Just a Hook(线段树)

题目大意: dota2里面有个英雄叫屠夫,屠夫有一个钩子武器,武器上面有n个勾钉,一开始这些勾钉全部是用铜做的。后来规定屠夫可以对钩子做m次修改,使得钩子上一部分连续的勾钉改为用银子做的,或者是金子...

HDU 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        线段树典型的染色操作    My code: //STATUS:C++_AC...

hdu 1698 Just a Hook (线段树区间更新+懒惰标记)

In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. T...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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