hdu1698 Just a Hook 解题报告

Just a Hook

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

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.
  
  
  
  

   
   这题用到了线段树的延迟标记，其实，说简单一点，就是这次查询的时候，我先不变，等下次再查询的时候，我就顺便就把这些延迟的更新，就行了，这样的话，能充分用到UPDAT（）这个函数，延迟标记，就是线段树的精华，必须要理解！
  
  
  
  

   
   
#include <iostream>
#include <stdio.h>
using namespace std;
#define N 500000
int l[N<<2],flag[N<<2];//l就 是总合 flag标记状态
void build(int num ,int s,int e)
{
      flag[num]=0;
      l[num]=1;
      if(s==e)
            return ;

      int mid=(s+e)>>1;

      build(num<<1,s,mid);
      build(num<<1|1,mid+1,e);
      l[num]=l[num<<1]+l[num<<1|1];
}
void update(int num ,int s,int e,int a,int b,int c)
{
      if(a<=s&&b>=e)
      {
            flag[num]=c;
            l[num]=c*(e-s+1);
            return ;
      }
      if(flag[num])//是0的话，不变，到下次来更新
      {
            flag[num<<1]=flag[num<<1|1]=flag[num];
            l[num<<1]=(e-s+1-(e-s+1)/2)*flag[num];
            l[num<<1|1]=((e-s+1)/2)*flag[num];
            flag[num]=0;//查询进去后一定要标记成不更新状态
      }
      int mid=(s+e)/2;
      if(mid>=a)
            update(num<<1,s,mid,a,b,c);
      if(mid<b)
            update(num<<1|1,mid+1,e,a,b,c);
      l[num]=l[num<<1]+l[num<<1|1];

}
int main()
{
    int t,tt,m,n,a,b,c;
    scanf("%d",&t);
    for(tt=1;tt<=t;tt++)
    {

          scanf("%d",&n);
          build(1,1,n);
          scanf("%d",&m);
          while(m--)
          {
             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.\n",tt,l[1]);
    }
    return 0;
}