Count the Colors Time limit: 2 Seconds Memory Limit: 65536 KB Painting Some colored segments on a line, some previously painted segments could be covered by some the subsequent ones.

Your task is counting the segments of different colors you can see at last.

**Input**

The first line of all data set contains exactly one integer n, 1 <= n <= 8000, equal to the number of colored Segme Nts.

Each of the following n lines consists of exactly 3 nonnegative integers separated by single spaces:

X1 X2 C

X1 and X2 indicate the left endpoint and right endpoint of the segment, C indicates the color of the segment.

All the numbers is in the range [0, 8000], and they is all integers.

Input may contain several data set, and process to the end of file.

**Output**

Each line of the output should contain a color index this can be seen from the top, following the count of the segments of This color, they should is printed according to the color index.

If some color can ' t is seen, you shouldn ' t print it.

Print a blank line after every dataset.

**Sample Input**

5

0 4 4

0 3 1

3 4 2

0 2 2

0 2 3

4

0 1 1

3 4 1

1 3 2

1 3 1

6

0 1 0

1 2 1

2 3 1

1 2 0

2 3 0

1 2 1

**Sample Output**

1 1

2 1

3 1

1 1

0 2

1 1

The specific approach is to update the interval when the lazy operation, endpoint statistics when the violence,.

#include <cstdio> #include <cstring> #include <algorithm> #include <vector> #include <string > #include <iostream> #include <queue> #include <cmath> #include <map> #include <stack> #include <bitset>using namespace std; #define REPF (I, A, b) for (int i = A; I <= B; + + i) #define REP (i, n ) for (int i = 0; i < n; + + i) #define CLEAR (A, X) memset (A, x, sizeof a) typedef long long Ll;typedef pair& lt;int,int>pil;const int maxn=8000+10;int sum[maxn<<2];int cnt,n;int col[maxn],ans[maxn];void pushdown (int RS) {if (sum[rs]!=-1) {sum[rs<<1]=sum[rs<<1|1]=sum[rs]; Sum[rs]=-1; }}void Update (int x,int y,int c,int l,int r,int rs) {if (l>=x&&r<=y) {sum[rs]=c; return; } pushdown (RS); int mid= (L+R) >>1; if (x<=mid) update (X,Y,C,L,MID,RS<<1); if (y>mid) update (x,y,c,mid+1,r,rs<<1|1);} void Solve (int l,int R,int RS) {if (l==R) {Col[cnt++]=sum[rs]; return; } pushdown (RS); int mid= (L+R) >>1; Solve (l,mid,rs<<1); Solve (mid+1,r,rs<<1|1);} int main () {int l,r,x; while (~SCANF ("%d", &n)) {cnt=0; CLEAR (sum,-1); CLEAR (ans,0); int m=8000; REP (i,n) {scanf ("%d%d%d", &l,&r,&x); Update (l,r-1,x,0,m,1); } solve (0,m,1); REP (i,cnt) {int j=i+1; if (col[i]!=-1) ans[col[i]]++; while (col[j]==col[i]&&j<cnt) j + +; I=j-1; } for (int i=0;i<=maxn;i++)//for color Kind if (Ans[i]) printf ("%d%d\n", i,ans[i]); Puts (""); } return 0;}

ZOJ 1610 Count the Colors (segment tree lazy+ violence statistics)