hdu 1698 Just a Hook(线段树)
2014-08-15 09:54
176 查看
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17481 Accepted Submission(s): 8731
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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <string>
#define maxn 100010
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ALL %I64d
using namespace std;
typedef long long ll;
struct segment
{
int l,r;
int value;
int nv;
} son[maxn<<2];
void PushUp(int rt)
{
son[rt].value=son[rt<<1].value+son[rt<<1|1].value;
}
void Build(int l,int r,int rt)
{
son[rt].l=l;
son[rt].r=r;
son[rt].nv=0;
if(l==r)
{
son[rt].value=1;
return;
}
int m=(l+r)/2;
Build(lson);
Build(rson);
PushUp(rt);
}
void Update_n(int w,int l,int r,int rt)
{
if(son[rt].l==l&&son[rt].r==r)
{
son[rt].value=w*(r-l+1);
son[rt].nv=w;
return;
}
if(son[rt].nv)
{
son[rt<<1].nv=son[rt].nv;
son[rt<<1|1].nv=son[rt].nv;
son[rt<<1].value=(son[rt<<1].r-son[rt<<1].l+1)*son[rt].nv;
son[rt<<1|1].value=(son[rt<<1|1].r-son[rt<<1|1].l+1)*son[rt].nv;
son[rt].nv=0;
}
int m=(son[rt].l+son[rt].r)/2;
if(r<=m)
Update_n(w,l,r,rt<<1);
else if(l>m)
Update_n(w,l,r,rt<<1|1);
else
{
Update_n(w,lson);
Update_n(w,rson);
}
PushUp(rt);
}
int main()
{
int n,m,cas=1,l,r,v;
scanf("%d",&cas);
for(int ca=1;ca<=cas;ca++)
{
scanf("%d",&n);
Build(1,n,1);
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&l,&r,&v);
Update_n(v,l,r,1);
}
printf("Case %d: The total value of the hook is %d.\n",ca,son[1].value);
}
return 0;
}
/*
线段树的简单题,学会区间更新的懒惰标记就可以了。
*/
相关文章推荐
- hdu1698 Just a Hook(线段树+区间染色)
- HDU 1698 just a hook 线段树
- HDU 1698 Just a Hook 线段树(成段更新)
- HDU 1698 JUST A HOOK(线段树)
- HDU 1698 Just a Hook(线段树:区间set,区间查询)
- E - Just a Hook HDU - 1698——线段树区间更新+lazy标记
- HDU 1698 Just a Hook(线段树)
- hdu 1698 Just a Hook(线段树求总区间和)
- hdu 1698 Just a Hook(线段树)
- HDU 1698 JUST a hook (线段树 成段替换 区间求和 延迟标记)
- HDU 1698 Just a Hook(线段树/区间更新)
- HDU 1698 - Just a Hook(线段树区间更新)
- HDU 1698 Just a Hook (线段树区间更新)
- hdu 1698 Just a Hook 线段树
- HDU 1698 Just a Hook 线段树成段更新
- HDU 1698 Just a hook 线段树
- HDU 1698 Just a Hook【线段树】区间修改,查询总和
- HDU 1698 Just a Hook(线段树 + Lazy Tag(延迟更新))
- hdu 1698 Just a Hook 线段树
- HDU 1698 Just a Hook 线段树