Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 42935 Accepted Submission(s): 2064
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.
题意:对于一个长为n的区间,一开始区间内的所有值都是1。有q个操作,每个操作是对一个子区间内每个值都更改为z,最后输出1-n区间和
利用线段树很容易实现
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define lson (l+r)<<1
#define rson (l+r)<<1|1
const ll N=200005;
ll tree[N*4];
ll lazy[N*4];//延时标记
ll n;
void pushdown(ll rt,ll l,ll r)
{
if(lazy[rt]==0)return;
lazy[lson]=lazy[rt];
lazy[rson]=lazy[rt];
ll mid=(l+r)>>1;
tree[lson]=(mid-l+1)*lazy[rt];
tree[rson]=(r-mid)*lazy[rt];
lazy[rt]=0;//向下更新好之后,父节点的延时标记就取消掉
}
void bulid(ll rt,ll l,ll r)//根据题意先建一棵每个叶子是1的树
{
if(l==r)
{
tree[rt]=1;
return;
}
ll mid=(l+r)>>1;
bulid(lson,l,mid);
bulid(rson,mid+1,r);
tree[rt]=tree[lson]+tree[rson];//更新父亲节点
}
void updata(ll x,ll y,ll l,ll r,ll rt,ll z)
{
if(x<=l&&y>=r)
{
tree[rt]=(r-l+1)*z;//因为是更换值所以用 =
lazy[rt]=z;
return;
}
pushdown(rt,l,r);
ll mid=(l+r)>>1;
if(y<=mid)updata(x,y,l,mid,lson,z);
else if(x>mid)updata(x,y,mid+1,r,rson,z);
else updata(x,mid,l,mid,lson,z),updata(mid+1,y,mid+1,r,rson,z);
tree[rt]=tree[lson]+tree[rson];
}
void init()
{
memset(lazy,0,sizeof(lazy));
memset(tree,0,sizeof(tree));
}
int main()
{
int t,ca=0;
scanf("%d",&t);
while(t--)
{
init();
scanf("%lld",&n);
bulid(1,1,n);
int q;
scanf("%d",&q);
ll x,y,z;
for(int i=1;i<=q;i++)
{
scanf("%lld%lld%lld",&x,&y,&z);
updata(x,y,1,n,1,z);
}
printf("Case %d: The total value of the hook is %lld.\n",++ca,tree[1]);
//tree[1]就是树中所有叶子的总和
}
}
有一个最坑的地方就是输出最后有一个点,一开始没看到wa到自闭。