zoukankan      html  css  js  c++  java
  • HDU 1698 Just a Hook(线段树lazy成段更新)

    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.
     
    #include<cstdio>
    using namespace std;
    const int maxn=100050;
    int sum[maxn<<2];
    int add[maxn<<2];
    struct node
    {
        int l,r;
    }tree[maxn<<2];
    void PushUp(int rt)
    {
        sum[rt]=sum[rt<<1]+sum[rt<<1|1];
    }
    void PushDown(int rt,int m)
    {
        if(add[rt])
        {
            add[rt<<1]=add[rt];
            add[rt<<1|1]=add[rt];
            sum[rt<<1]=add[rt]*(m-(m>>1));
            sum[rt<<1|1]=add[rt]*(m>>1);
            add[rt]=0;
        }
    }
    void build(int l,int r,int rt)
    {
        tree[rt].l=l;
        tree[rt].r=r;
        add[rt]=0;
        if(l==r)
        {
            sum[rt]=1;
            return;
        }
        int mid=(r+l)>>1;
        build(l,mid,rt<<1);
        build(mid+1,r,rt<<1|1);
        PushUp(rt);
    }
    void update(int t,int l,int r,int rt)
    {
        if(tree[rt].l==l&&tree[rt].r==r)
        {
            add[rt]=t;
            sum[rt]=t*(r-l+1);
            return;
        }
        if(tree[rt].l==tree[rt].r)return;
        PushDown(rt,tree[rt].r-tree[rt].l+1);
        int mid=(tree[rt].r+tree[rt].l)>>1;
        if(r<=mid)update(t,l,r,rt<<1);
        else if(l>mid)update(t,l,r,rt<<1|1);
        else
        {
            update(t,l,mid,rt<<1);
            update(t,mid+1,r,rt<<1|1);
        }
        PushUp(rt);
    }
    int query(int l,int r,int rt)
    {
        if(l==tree[rt].l&&r==tree[rt].r)
        {
            return sum[rt];
        }
        PushDown(rt,tree[rt].r-tree[rt].l+1);
        int mid=(tree[rt].l+tree[rt].r)>>1;
        int ans=0;
        if(r<=mid)ans+=query(l,r,rt<<1);
        else if(l>mid)ans+=query(l,r,rt<<1|1);
        else
        {
            ans+=query(l,mid,rt<<1);
            ans+=query(mid+1,r,rt<<1|1);
        }
        return ans;
    }
    int main()
    {
        int i,t,a,b,val,n,m;
        scanf("%d",&t);
        for(i=1;i<=t;i++)
        {
            scanf("%d",&n);
            build(1,n,1);
            scanf("%d",&m);
            while(m--)
            {
                scanf("%d%d%d",&a,&b,&val);
                update(val,a,b,1);
            }
            int ans=query(1,n,1);
            printf("Case %d: The total value of the hook is %d.
    ",i,ans);
        }
        return 0;
    }
     
  • 相关阅读:
    php 删除文件夹下的所有文件
    IBM AppScan 安全扫描:加密会话(SSL)Cookie 中缺少 Secure 属性 处理办法
    Tomcat/weblogic session失效时间的几种设置方法
    truncate与delete的区别
    oninput,onpropertychange,onchange的用法和区别
    HttpSessionBindingListener和HttpSessionAttributeListener区别
    insert table 和create table as 区别
    慎用create table as select,一定要注意默认值的问题
    mysql in与or效率比较
    值域范围
  • 原文地址:https://www.cnblogs.com/homura/p/4709009.html
Copyright © 2011-2022 走看看