zoukankan      html  css  js  c++  java
  • HDU1698 Just a Hook (区间更新)

    Just a Hook

    Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 23644    Accepted Submission(s): 11839


    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.
    题意:区间和为多少?
    收获:tre[num],lazy[num]代表什么很重要。
    #include <cstdio>
    #include <iostream>
    #include <cstdlib>
    #include <algorithm>
    #include <ctime>
    #include <cmath>
    #include <string>
    #include <cstring>
    #include <stack>
    #include <queue>
    #include <list>
    #include <vector>
    #include <map>
    #include <set>
    using namespace std;
    
    const int INF=0x3f3f3f3f;
    const double eps=1e-10;
    const double PI=acos(-1.0);
    #define maxn 110000
    int tre[maxn*4];
    int lazy[maxn*4];
    void build(int num, int le, int ri)
    {
        if(le == ri)
        {
            tre[num] = 1;
            return;
        }
        int mid = (le+ri)/2;
        build(num*2, le, mid);
        build(num*2+1, mid+1, ri);
        tre[num] = tre[num*2] + tre[num*2+1];
    }
    void pushdown(int num, int le, int mid, int ri)
    {
        if(lazy[num]!=0)
        {
            lazy[num*2] = lazy[num];
            lazy[num*2+1] = lazy[num];
            tre[num*2] = (mid-le+1)*lazy[num*2];
            tre[num*2+1] = (ri-mid)*lazy[num*2+1];
            lazy[num] = 0;
        }
    }
    
    void update(int num, int le, int ri, int x, int y, int val)
    {
        if(x<=le && y>=ri)
        {
            tre[num] = (ri-le+1)*val;
            lazy[num] = val;
            return;
        }
        int mid = (le+ri)/2;
        pushdown(num,le,mid,ri);
        if(x<=mid)
            update(num*2,le,mid,x,y,val);
        if(y>mid)
            update(num*2+1,mid+1,ri,x,y,val);
        tre[num] = tre[num*2] + tre[num*2+1];
    }
    int main()
    {
        int t;
        scanf("%d", &t);
        int cas = 0;
        while(t--)
        {
            int n;
            scanf("%d", &n);
            build(1,1,n);
            memset(lazy, 0, sizeof lazy);
            int m;
            scanf("%d", &m);
            for(int i = 0; i < m; i++)
            {
                int a,b,c;
                scanf("%d%d%d", &a, &b, &c);
                update(1,1,n,a,b,c);
            }
            printf("Case %d: The total value of the hook is %d.
    ", ++cas, tre[1]);
        }
        return 0;
    }
     
  • 相关阅读:
    1、向服务传送复杂的类型实例(服务端程序)(摘自ProAndroid2)
    我项目中用到的jquery+json+struts2
    JSON与JAVA的数据转换
    管理和组织首选项
    python中如何对dict对象进行排序
    python cx_Oracle模块的安装和使用(linux环境)
    python cx_Oracle模块的安装和使用(linux环境)
    django的一个小功能——SortedDict
    Linux中source命令的用法
    linux uname命令参数及用法详解linux查看系统信息命令
  • 原文地址:https://www.cnblogs.com/ZP-Better/p/4857846.html
Copyright © 2011-2022 走看看