so_so_y的博客

红鲤鱼绿鲤鱼与驴律与率

HDU 1698 Just a Hook(线段树区间更新+区间求和+染色问题)

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次操作分别是将区间[l,r]的数全部修改为z.输出最终状态下所有数的和

解题思路

类似于区间染色问题,建树时全部染色为1,查询结果时,只要color[]!=-1,即代表这个区间内的值全部为color[],则ans+=(r-l)*color[].

代码实现

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 100007
int color[maxn<<4];
int ans;
void build(int l,int r,int root)
{
    color[root]=1;
    if(l==r) return ;
    int m=(l+r)/2;
    build(l,m,root<<1);
    build(m+1,r,root<<1|1);
}
void PushDown(int root)
{
    color[root<<1]=color[root<<1|1]=color[root];
    color[root]=-1;
}
void Update(int L,int R,int c,int l,int r,int root)
{
    if(L<=l&&R>=r)
    {
        color[root]=c;
        return ;
    }
    if(color[root]!=-1) PushDown(root);
    int m=(l+r)/2;
    if(m>=L) Update(L,R,c,l,m,root<<1);
    if(m<R) Update(L,R,c,m+1,r,root<<1|1);
}
void Query(int L,int R,int l,int r,int root)
{
    if(color[root]!=-1)
    {
        ans+=color[root]*(r-l+1);
        return ;
    }
    if(l==r) return;
    int m=(l+r)/2;
    if(m>=L)
        Query(L,R,l,m,root<<1);
    if(m<R)
        Query(L,R,m+1,r,root<<1|1);
}
int main()
{
    int T,n,Q;
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++)
    {
        ans=0;
        scanf("%d",&n);
        build(1,n,1);
        scanf("%d",&Q);
        int l,r,t;
        while(Q--)
        {
            scanf("%d %d %d",&l,&r,&t);
            Update(l,r,t,1,n,1);
        }
        Query(1,n,1,n,1);
        printf("Case %d: The total value of the hook is %d.\n",cas,ans);
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/so_so_y/article/details/78575805
个人分类: HDU 数据结构
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

HDU 1698 Just a Hook(线段树区间更新+区间求和+染色问题)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭