hdu1698(线段树染色区间求和)

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

Just a Hook

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

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.

 

Source

2008 “Sunline Cup” National Invitational Contest

 

Recommend

wangye

题意：给一组棍子染色，不同的颜色有不同的值，执行一系列的区间染色后，问这组棍子的总值是多少。

每个线段树的结点，存储该结点所代表区间的染色状况c，如果该区间全为同样的颜色，则用一个正数表示，如果含有多种颜色，则用-1表示，每次执行染色操作时，如果所要染的颜色与区间颜色一样，则停止，如果所要染区间跟当前结点区间一致，则直接将所要染颜色赋给当前结点的c,否则，如果当前结点区间不是混合色，则先将当前结点的颜色赋给左右子结点的c,并递归下去。

#include
#include
#include
using namespace std;
#define maxn 100010

struct node
{
      int l;
      int r;
      int num;//该段的颜色 1、2、3；标记-1 表示该段不为纯色。
}s[maxn*3];

void build(int l,int r,int i)//建树
{
      s[i].l=l;
      s[i].r=r;
      s[i].num=1;//初始时都为1
      if(l==r)
      {
              return;
      }
      int mid=(l+r)/2;
      build(l,mid,i*2);
      build(mid+1,r,i*2+1);
}

void update(int a,int b,int c,int i)//从left到right更改为col
{
      if(a<=s[i].l&&s[i].r<=b)//要更新的段包含当前段，就更新
      {
              s[i].num=c;//把值c赋给s[i].num
              return;
      }
      if(s[i].num!=-1)
      {
              s[i*2].num=s[i].num;
              s[i*2+1].num=s[i].num;
              s[i].num=-1;
      }
      int mid=(s[i].l+s[i].r)/2;
      //成段更新不同于前面的中点划分
      if(a<=mid)
      {
              update(a,b,c,i*2);
      }
      if(b>mid)
      {
              update(a,b,c,i*2+1);
      }
}

int query(int a,int b,int i)
{
      if(s[i].num!=-1)
      {
              return s[i].num*(b-a+1);
      }
      int mid=(s[i].l+s[i].r)/2;
      if(b<=mid)
      {
              return query(a,b,i*2);
      }
      if(a>mid)
      {
              return query(a,b,i*2+1);
      }
      else
      {
              return query(a,mid,i*2)+query(mid+1,b,i*2+1);
      }
}

int main()
{
      int t;
      int n,m;
      int cc=0;
      int a,b,c;
      scanf("%d",&t);
      while(t--)
      {
              scanf("%d",&n);
              build(1,n,1);//建树
              scanf("%d",&m);
              for(int i=0;i
              {
                      scanf("%d%d%d",&a,&b,&c);
                      update(a,b,c,1);//每输入一次结点就进行一次更新
              }
              printf("Case %d: The total value of the hook is %d.\n",++cc,query(1,n,1));
      }
      return 0;
}