POJ 2777 (线段树)

Count Color

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 24867		Accepted: 7375

Description

Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. 

There is a very long board with length L centimeter, L is a positive integer, so we can evenly divide the board into L segments, and they are labeled by 1, 2, ... L from left to right, each is 1 centimeter long. Now we have to color the board - one segment with only one color. We can do following two operations on the board: 

1. "C A B C" Color the board from segment A to segment B with color C. 
2. "P A B" Output the number of different colors painted between segment A and segment B (including). 

In our daily life, we have very few words to describe a color (red, green, blue, yellow…), so you may assume that the total number of different colors T is very small. To make it simple, we express the names of colors as color 1, color 2, ... color T. At the beginning, the board was painted in color 1. Now the rest of problem is left to your. 

Input

First line of input contains L (1 <= L <= 100000), T (1 <= T <= 30) and O (1 <= O <= 100000). Here O denotes the number of operations. Following O lines, each contains "C A B C" or "P A B" (here A, B, C are integers, and A may be larger than B) as an operation defined previously.

Output

Ouput results of the output operation in order, each line contains a number.

这道题是裸的线段树。。。可我一直不知道为什么TLE到死。。。。

#include<stdio.h>
#include<string.h>

#define maxn 100005

#define clear(a) memset(a,0,sizeof(a))
#define Mid(i) ((i)>>1)
#define L(i) ((i)<<1)
#define R(i) (((i)<<1)+1)

struct tree{
  int l,r,c;
  } T[maxn*4];

int b[40],ans,len,t,o;

void Build(int l,int r,int n)
{
  T[n].l = l;
  T[n].r = r;
  T[n].c = 1;
  if (l == r) return ;
  int m = Mid(l+r);
  Build(l,m,L(n));
  Build(m+1,r,R(n));
}

void ins(int l,int r,int c,int n)
{
  if (T[n].c == c) return ;
  if ((l == T[n].l && r == T[n].r) || T[n].r == T[n].l) {
    T[n].c = c;
    return ;
    }
  if (T[n].c && T[n].c != c) {
    T[L(n)].c = T[R(n)].c = T[n].c;
    T[n].c = 0;
    }
  int m = Mid(T[n].l+T[n].r);
  if (r <= m) ins(l,r,c,L(n));
  else if (l > m)  ins(l,r,c,R(n));
  else {
    ins(l,m,c,L(n));
    ins(m+1,r,c,R(n));
    }
}

void vis(int l,int r,int n)
{
  if (T[n].c > 0) {
    b[T[n].c] = 1;
    return ;
    }
  int m = Mid(T[n].l+T[n].r);
  if (r <= m) vis(l,r,L(n));
  else if (l > m)  vis(l,r,R(n));
  else {
    vis(l,m,L(n));
    vis(m+1,r,R(n));
    }
}

void init()
{
  int temp,s1,s2,s3,i;
  char tc[5];

  scanf("%s",tc);
  if (tc[0] == 'C') {
    scanf("%d%d%d",&s1,&s2,&s3);
    if (s1 > s2) {
      temp = s1;
      s1 = s2;
      s2 = temp;
      }
    ins(s1,s2,s3,1);
    return ;
    }
  else {
    scanf("%d%d",&s1,&s2);
      if (s1 > s2) {
      temp = s1;
      s1 = s2;
      s2 = temp;
      }
    ans = 0;
    clear(b);
    vis(s1,s2,1);
    for(i = 1;i <= t;i++) ans += b[i];
    printf("%d\n",ans);
    return ;
    }
}

void work()
{
  int v;
  scanf("%d%d%d",&len,&t,&o);
  clear(T);
  Build(1,len,1);
  for(v = 1;v <= o;v++) init();
  return ;
}

int main()
{
  work();
  return 0;
}