程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> ZOJ 1610 Count the Colors（線段樹lazy+暴力統計）

ZOJ 1610 Count the Colors（線段樹lazy+暴力統計）

編輯：C++入門知識

ZOJ 1610 Count the Colors（線段樹lazy+暴力統計）

Count the Colors

Time Limit: 2 Seconds Memory Limit: 65536 KB

Painting some colored segments on a line, some previously painted segments may 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 each data set contains exactly one integer n, 1 <= n <= 8000, equal to the number of colored segments.

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 are in the range [0, 8000], and they are all integers.

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

Output

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

If some color can't be 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

具體做法就是區間更新的時候lazy操作，端點統計的時候暴力，。

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
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 pairpil;
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