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 线段树

Just a Hook Problem Description   In the game of DotA, Pudge’s meat hook is actually the most...

hdu1698(线段树,区间着色)

题意:一个长度为n的数组,开始时价值均为1,之后有m次操作,修改一定区间的价值(1-3),最后求总价值 思路:lazy的思想:每次处理的时候不需要修改到最根部,只需要修改到某个区间,每次都判断一下该...

hdu 1698 Just a Hook 线段树区间更新

基本的线段更新(lazy标记)  线段树代码敲起来还是挺爽的 #include const int N=100005; #define lson l,m,rt...

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

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
  • Q_smell
  • Q_smell
  • 2017年03月30日 15:02
  • 105

hdu1698 Just a Hook(线段树成段更新lazy)

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

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
  • 166

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

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

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

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

hdu1698 Just a Hook (线段树,区间更新)

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

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

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU1698 线段树
举报原因:
原因补充:

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