zoukankan      html  css  js  c++  java
  • HDU1698:Just a Hook(线段树区域更新模板题)

    http://acm.hdu.edu.cn/showproblem.php?pid=1698

    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 <stdlib.h>
    #include <algorithm>
    #define N 1000010
    using namespace std;
    struct node
    {
        int l,r,lz,w;
    } q[4*N];
    int n;
    void pushup(int rt)
    {
        q[rt].w=q[rt<<1].w+q[rt<<1|1].w;
    }
    void pushdown(int rt,int len)
    {
        if(q[rt].lz)
        {
            q[rt<<1].lz=q[rt].lz;
            q[rt<<1|1].lz=q[rt].lz;
            q[rt<<1].w=q[rt].lz*(len-(len>>1));
            q[rt<<1|1].w=q[rt].lz*(len>>1);
            q[rt].lz=0;
        }
    }
    void build(int l,int r,int rt)
    {
        q[rt].l=l;
        q[rt].r=r;
        q[rt].w=1;
        q[rt].lz=0;
        if(l==r)
            return ;
        int mid=(l+r)>>1;
        build(l,mid,rt<<1);
        build(mid+1,r,rt<<1|1);
        pushup(rt);
        return ;
    }
    void update(int lf,int rf,int l,int r,int rt,int key)
    {
        if(lf<=l&&rf>=r)
        {
            q[rt].w=key*(r-l+1);
            q[rt].lz=key;
            return ;
        }
        pushdown(rt,(r-l+1));
        int mid=(l+r)>>1;
        if(lf<=mid) update(lf,rf,l,mid,rt<<1,key);
        if(rf>mid) update(lf,rf,mid+1,r,rt<<1|1,key);
        pushup(rt);
    }
    int main()
    {
        int T,m,s1,s2,key;
        scanf("%d",&T);
        for(int z=1; z<=T; z++)
        {
            scanf("%d",&n);
            build(1,n,1);
            scanf("%d",&m);
            for(int i=0; i<m; i++)
            {
                scanf("%d%d%d",&s1,&s2,&key);
                update(s1,s2,1,n,1,key);
            }
            printf("Case %d: The total value of the hook is %d.
    ",z,q[1].w);
        }
    }
  • 相关阅读:
    致亲爱的304
    C语言中简单的for循环和浮点型变量
    C程序内存管理
    变量
    我哭了
    那一场邂逅
    如何修改安卓项目的图标
    Android requires compiler compliance level 5.0 or 6.0. Found '1.4' instead.解决方法
    Android 异步加载
    大家好,第一次用博客记录一些东西
  • 原文地址:https://www.cnblogs.com/zhangmingcheng/p/4149773.html
Copyright © 2011-2022 走看看