Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23481 Accepted Submission(s): 11758
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 <iostream>
#include <stdio.h>
#include <string.h>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
const int maxn=100000+10;
const int inf=(1<<30);
struct Node
{
int l,r,sum,mark; //sum 为区间的和 mark：被标记过没 1 标记过
int ic; //上次更新的值
int mid()
{
return (l+r)/2;
}
}tree[maxn*4];
void Buildtree(int rt,int l,int r)
{
tree[rt].l=l;
tree[rt].r=r;
tree[rt].ic=0;
tree[rt].mark=0;
if(l!=r)
{
Buildtree(2*rt,l,(l+r)/2);
Buildtree(2*rt+1,(l+r)/2+1,r);
tree[rt].sum=tree[2*rt].sum+tree[rt*2+1].sum; //回溯求和
}
else
tree[rt].sum=1;
}
void Update(int rt,int l,int r,int val)
{
if(tree[rt].l==l&&tree[rt].r==r) //找到区间时的结果 标记为1
{
tree[rt].sum=(tree[rt].r-tree[rt].l+1)*val;
tree[rt].ic=val;
tree[rt].mark=1;
return;
}
if(tree[rt].mark) //当被标记时向下两个儿子也要更新父节点所更新的值
{
tree[2*rt].sum=(tree[2*rt].r-tree[2*rt].l+1)*tree[rt].ic;
tree[2*rt+1].sum=(tree[2*rt+1].r-tree[2*rt+1].l+1)*tree[rt].ic;
tree[2*rt].mark=tree[2*rt+1].mark=1; //标记为1
tree[2*rt].ic=tree[2*rt+1].ic=tree[rt].ic;
tree[rt].mark=tree[rt].ic=0; //标记为0
}
if(r<=tree[rt].mid())
Update(2*rt,l,r,val);
else if(l>tree[rt].mid())
Update(2*rt+1,l,r,val);
else
{
Update(2*rt,l,tree[rt].mid(),val);
Update(2*rt+1,tree[rt].mid()+1,r,val);
}
tree[rt].sum=tree[2*rt].sum+tree[rt*2+1].sum;
}
int main()
{
int t,cnt=1;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
Buildtree(1,1,n);
int m;
scanf("%d",&m);
while(m--)
{
int l,r,val;
scanf("%d%d%d",&l,&r,&val);
Update(1,l,r,val);
}
printf("Case %d: The total value of the hook is %d.\n",cnt++,tree[1].sum);
}
return 0;
}