/*http://acm.hdu.edu.cn/showproblem.php?pid=1698
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12373 Accepted Submission(s): 6147
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
2008 “Sunline Cup” National Invitational Contest
Recommend
wangye
解析:在1---n个挂钩初始化化为1,给出m个操作。
问最后1--n个挂钩的和是多少
思路:
一道裸的线段树题。改变一段区间的值,查询一段区间的和问题
Ps:要注意边界处理,区间信息维护,以及标记传递
纠结了好久,最终KB神改了之后才过的
984 MS 4448 KB GNU C++
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include <iostream>
using namespace std;
const int maxn=100000+10;
int n,m;
struct hook
{
int r;
int l;
int sum;
int setv;
}h[maxn*4];
/*
void maintain(int i)
{
h[i].sum=h[i<<1].sum+h[i<<1|1].sum;
//h[i<<1].setv=h[i<<1|1].setv=h[i].setv;
}
*/
void push_up(int i)
{
if(h[i].r == h[i].l)return;//注:叶子结点不必更新
h[i].sum = h[i<<1].sum + h[(i<<1)|1].sum;
}
void build(int k,int l,int r)
{
h[k].l=l;
h[k].r=r;
h[k].setv=0;//初始化为0;
if(l==r)
{
h[k].sum=1;//当到达叶子结点时其和的值才等于一个元素
return;}
int mid=(l+r)/2;
build(k<<1,l,mid);
build((k<<1)|1,mid+1,r);
//maintain(k);
push_up(k);//注:一旦有改变都要维护区间信息
}
void pushdown(int k)//标记传递
{
if(h[k].setv>0)
{
h[(k<<1)|1].setv=h[k<<1].setv=h[k].setv;//当前的传递给左右子树
h[k<<1].sum = h[k<<1].setv*(h[k<<1].r-h[k<<1].l+1);//左右子树的关键值也发生相应变化
h[(k<<1)|1].sum = h[(k<<1)|1].setv *(h[(k<<1)|1].r - h[(k<<1)|1].l+1);
h[k].setv=0;//清除本结点标记
}
}
void update(int x,int y,int k,int v)//更新节点
{
if(x<=h[k].l&&y>=h[k].r)//到达边界
{
h[k].sum = v * (h[k].r-h[k].l+1);//附加值直接更新
h[k].setv=v;
return;
}
else
{
pushdown(k);//向下传递标记
int mid=(h[k].l+h[k].r)/2;
//if(x<=mid)update(x,y,k<<1,v);
//if(y>mid)update(x,y,k<<1|1,v);
if(y <= mid)update(x,y,k<<1,v);//判断区间更新左右区间
else if(x > mid)update(x,y,(k<<1)|1,v);
else//否则同时更改左右区间
{
update(x,mid,k<<1,v);
update(mid+1,y,(k<<1)|1,v);
}
push_up(k);//一旦发生改变后就要进行信息维护
}
//maintain(k);
}
int query(int s,int t,int k)
{
if(s==h[k].l && t == h[k].r)//当刚好到达某一区间时直接返回
return h[k].sum;
pushdown(k);//否则继续传递标记
int mid=(h[k].l+h[k].r)/2;
if(t <= mid)query(s,t,k<<1);//判断位置进行查询
else if(s > mid)query(s,t,(k<<1)|1);
else query(s,mid,k<<1)+query(mid+1,t,(k<<1)|1);//否则左右子树要进行相加
/*
int ans=0;
if(h[k].setv>0)
{
ans+=h[k].setv*(min(h[k].r,t)-max(h[k].l,s)+1);
}
else if(s<=h[k].l&&t>=h[k].r)
{
ans+=h[k].sum;
}
else
{
int mid=(h[k].l+h[k].r)/2;
if(s<=mid)query(s,t,k<<1);
if(t>mid)query(s,t,k<<1|1);
}
return ans;
*/
}
int main()
{
int i,j;
int T,cnt=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
build(1,1,n);
//printf("ans=%d\n",query(1,n,1));
int s,t,v;
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&s,&t,&v);
update(s,t,1,v);
}
int ans=query(1,n,1);
printf("Case %d: The total value of the hook is %d.\n",++cnt,ans);
}
//system("pause");
return 0;
}