Count the Colors
2015-07-08 20:24
260 查看
B - Count the Colors
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status
Description
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
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status
Description
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
/* Author: 2486 Memory: 232 KB Time: 110 MS Language: C++ (g++ 4.7.2) Result: Accepted */ //暴力可过,或者是线段树 #include <cstdio> #include <cstring> #include <algorithm> typedef long long ll; using namespace std; const int maxn=8000+5; int n,a,b,c,ans[maxn],col[maxn]; int main() { while(~scanf("%d",&n)) { memset(ans,0,sizeof(ans)); memset(col,0,sizeof(col)); int Max=0; for(int i=0; i<n; i++) { scanf("%d%d%d",&a,&b,&c); for(int j=a; j<b; j++) { col[j]=c+1; } Max=max(Max,b); } for(int i=0; i<=Max; i++) { while(i!=0&&col[i]&&col[i]==col[i-1]) { i++; } if(col[i]) { ans[col[i]-1]++; } } for(int i=0; i<=8001; i++) { if(ans[i]) { printf("%d %d\n",i,ans[i]); } } printf("\n"); } }
/* Author: 2486 Memory: 356 KB Time: 20 MS Language: C++ (g++ 4.7.2) Result: Accepted */ #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn=8000+5; int sum[maxn],col[maxn<<2],res[maxn]; int n,x1,x2,c; void pushup(int rt) {} void pushdown(int rt,int l,int r) { if(col[rt]!=-1) { col[rt<<1]=col[rt<<1|1]=col[rt];//直接往下递归就可以了,不用管其他 col[rt]=-1; } } void build(int rt,int l,int r) { col[rt]=-1; if(l==r)return; int mid=(l+r)>>1; build(rt<<1,l,mid); build(rt<<1|1,mid+1,r); } void update(int L,int R,int c,int rt,int l,int r) { if(L<=l&&r<=R) { col[rt]=c; return; } pushdown(rt,l,r); int mid=(l+r)>>1; if(L<=mid)update(L,R,c,rt<<1,l,mid); if(mid<R)update(L,R,c,rt<<1|1,mid+1,r); pushup(rt); } void query(int L,int R,int rt,int l,int r) { if(l==r) { sum[l]=col[rt];//赋值,放回区间的位子颜色 return; } pushdown(rt,l,r); int mid=(l+r)>>1; if(L<=mid)query(L,R,rt<<1,l,mid); if(mid<R)query(L,R,rt<<1|1,mid+1,r); pushup(rt); } int main() { while(~scanf("%d",&n)) { memset(sum,-1,sizeof(sum)); memset(res,0,sizeof(res)); build(1,0,maxn-1); for(int i=0; i<n; i++) { scanf("%d%d%d",&x1,&x2,&c); if(x1==x2)continue; update(x1,x2-1,c,1,0,maxn-1); } query(0,maxn-1,1,0,maxn-1);//将所有数据都更新到底部 for(int i=0; i<maxn; i++) { while(i!=0&&sum[i]!=-1&&sum[i]==sum[i-1])//如果没有颜色就加一,如果与之前相等那么也是加一 i++; res[sum[i]]++; } for(int i=0; i<maxn; i++)if(res[i])printf("%d %d\n",i,res[i]); printf("\n"); } return 0; }
相关文章推荐
- vim温馨提示
- Mongodb的范式化和反范式化
- IOS中OC的BLOCK问题
- 数据结构与算法-约瑟夫问题
- iOS学习9_事件分发&响应链
- iOS学习9_事件分发&响应链
- 移动端高清、多屏适配方案
- [转]LNMP环境下的Web常见问题排查(精品)
- 字符串相乘(算法)
- LeetCode Rotate Array
- 【独立开发者er Cocos2d-x实战 002】使用Cocos Studio创建帧动画
- ER-Studio使用外键为null设定方法
- linux centos使用xrdp远程界面登陆
- Python的dict数据结构
- linux centos使用xrdp远程界面登陆
- HtmlParser基础教程
- 在Mac下配置php开发环境:Apache+php+MySql
- 南阳oj 题目34 韩信点兵
- 查看ecshop广告位对应的广告详细信息
- linux 查看系统信息命令(比较全)