# ACM 数据结构 线段树 HDU 1698Just a Hook

214人阅读 评论(0)

1. 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.

2. #include <stdio.h>
3. #include <string.h>
4. #include <algorithm>
5. using namespace std;
6. const int maxn = 100000+10;
7.
8. int n,sum;
9.
10. struct node
11. {
12.     int l,r,n;
13. } a[maxn<<2];
14.
15. void init(int l,int r,int i)
16. {
17.     a[i].l = l;
18.     a[i].r = r;
19.     a[i].n = 1;
20.     if(l!=r)
21.     {
22.         int mid = (l+r)>>1;
23.         init(l,mid,2*i);
24.         init(mid+1,r,2*i+1);
25.     }
26. }
27.
28. void insert(int i,int x,int y,int m)
29. {
30.     if(a[i].n == m)//相同则不用修改了
31.     return ;
32.     if(a[i].l == x && a[i].r == y)//找到了区间，直接更新
33.     {
34.         a[i].n = m;
35.         return ;
36.     }
37.     if(a[i].n != -1)//如果该区间只有一种颜色
38.     {
39.         a[2*i].n = a[2*i+1].n = a[i].n;//由于后面必定对子树操作，所以更新子树的值等于父亲的值
40.         a[i].n = -1;//由于该区域颜色与修改不同，而且不是给定区域，所以该区域必定为杂色
41.     }
42.     //父区间为杂色时对所有子节点进行操作
43.     int mid = (a[i].l+a[i].r)>>1;
44.     if(x>mid)
45.     insert(2*i+1,x,y,m);
46.     else if(y<=mid)
47.     insert(2*i,x,y,m);
48.     else
49.     {
50.         insert(2*i,x,mid,m);
51.         insert(2*i+1,mid+1,y,m);
52.     }
53. }
54.
55. int find(int i)//区间求和
56. {
57.     if(a[i].n != -1)//纯色直接算这个区间
58.     return (a[i].r - a[i].l+1)*a[i].n;
59.     else//不存则左右子树去找
60.     return find(i*2)+find(i*2+1);
61. }
62.
63. int main()
64. {
65.     int t,i,k,x,y,m;
66.     int cas = 1;
67.     scanf("%d",&t);
68.     while(t--)
69.     {
70.         scanf("%d%d",&n,&k);
71.         init(1,n,1);
72.         while(k--)
73.         {
74.             scanf("%d%d%d",&x,&y,&m);
75.             insert(1,x,y,m);
76.         }
77.         printf("Case %d: The total value of the hook is %d.\n",cas++,find(1));
78.     }
79.
80.     return 0;
81. }
0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：37384次
• 积分：2126
• 等级：
• 排名：第17844名
• 原创：183篇
• 转载：2篇
• 译文：0篇
• 评论：8条
文章分类
阅读排行
评论排行