F - Count the Colors

最新推荐文章于 2022-03-13 12:40:26 发布

原创最新推荐文章于 2022-03-13 12:40:26 发布 · 380 阅读

0 ·

CC 4.0 BY-SA版权

程序设计专栏收录该内容

34 篇文章

订阅专栏

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

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<queue>
#include<stack>
#include<iomanip>
#include<string>
#include<climits>
#include<cmath>
#define INF 0x3f3f3f3f
#define MAXN 8010
#define LL long long
using namespace std;
struct node{
    int l,r;
	int color;
};
node segTree[4*MAXN];

void build(int num,int l,int r)
{
	segTree[num].l=l;
	segTree[num].r=r;
	segTree[num].color=-1;
	//确定num的l和r以及color
	if(l==r)
		return;
	int mid=(l+r)>>1;
	build(num<<1,l,mid);
	build(num<<1|1,mid+1,r);
}

void pushdown(int num)
{
	segTree[num<<1].color=segTree[num<<1|1].color=segTree[num].color;
	segTree[num].color=-1;
}
void update(int num,int l,int r,int c)
{
	if(segTree[num].l>=l&&segTree[num].r<=r)
    {
    	segTree[num].color=c;
    	return;
    }
    if(segTree[num].l>r||segTree[num].r<l) return;
    if(segTree[num].color!=-1) pushdown(num);
    update(num<<1,l,r,c);
    update(num<<1|1,l,r,c);
}

int mark[MAXN],cnt;

void query(int l,int r,int x)
{
    if((l==segTree[x].l&&segTree[x].r==r&&segTree[x].color!=-1)||segTree[x].l==segTree[x].r)
    {
        mark[cnt++]=segTree[x].color;
        return;
    }
    LL tmp=x<<1;
    LL mid=(segTree[x].l+segTree[x].r)>>1;
    if(r<=mid)   return query(l,r,tmp);
    else if(l>mid)  return query(l,r,tmp+1);
    else
    {
        query(l,mid,tmp);
        query(mid+1,r,tmp+1);
    }
}

int main()
{
	int n;
	while(~scanf("%d",&n))
    {
        memset(mark,-1,sizeof(mark));
        int mmax=0;
        int x1[MAXN<<2],x2[MAXN<<2],c[MAXN<<2],sum[MAXN<<2];
        memset(sum,0,sizeof(sum));
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d%d",&x1[i],&x2[i],&c[i]);
            if(mmax<x2[i]) mmax=x2[i];
        }
        build(1,1,mmax);
        for(int i=1;i<=n;i++)
            update(1,x1[i]+1,x2[i],c[i]);
        query(1,mmax,1);
        for(int i=0;i<cnt;)
        {
            if(mark[i]==-1) {i++;continue;}
            else
            {
                int x=mark[i];
                while(mark[++i]==x&&i<cnt);
                sum[x]++;
            }
        }
        for(int i=0;i<8010;i++)
            if(sum[i])
         printf("%d %d\n",i,sum[i]);
        printf("\n");
    }
    return 0;
}