zoj1610Count the Colors【暴力 or 线段树】
来源:互联网 发布:2017人工智能高峰论坛 编辑:程序博客网 时间:2024/06/03 17:15
ZOJ - 1610
The first line of each data set contains exactly one integer n, 1 <= n <= 8000, equal to the number of colored segments.
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.
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
1 1
2 1
3 1
Count the Colors
Time Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %llu
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
Source
ZOJ Monthly, May 2003
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int sum[8010];int vis[8010];int main(){int n,i,j,k;while(scanf("%d",&n)!=EOF){memset(sum,-1,sizeof(sum));int a,b,c;for(i=0;i<n;++i){scanf("%d%d%d",&a,&b,&c);for(j=a+1;j<=b;++j){sum[j]=c;}}memset(vis,0,sizeof(vis));for(i=1;i<=8001;++i){if(sum[i]!=sum[i-1]){if(sum[i-1]!=-1){vis[sum[i-1]]++;}}}for(i=0;i<=8000;++i){if(vis[i]){printf("%d %d\n",i,vis[i]);}}printf("\n");}return 0;}
0 0
- zoj1610Count the Colors【暴力 or 线段树】
- ZOJ1610Count the Colors(线段树成段更新染色)
- ZOJ 1610 Count the Colors(暴力or线段树)
- Count the Colors (线段树,暴力)
- ZOJ 1610 Count the Colors 线段树/暴力模拟
- ZOJ 1610 Count the Colors(暴力或者线段树)
- ZOJ 1610 Count the Colors(线段树lazy+暴力统计)
- ZOJ 1610 Count the Colors(线段树,但暴力未必不行)
- hdu1484线段树or暴力
- Count the Colors(暴力)
- ZOJ1610 Count the Colors,线段树
- ZOJ 1610Count the Colors//线段树
- zoj 1610 Count the Colors【线段树】
- zoj 1610 Count the Colors[线段树]
- 【线段树】Count the Colors (zoj 1610)
- zoj 1610 Count the Colors(线段树)
- zoj1610 Count the Colors(线段树)
- zoj 1610 Count the Colors 线段树
- hdoj1528【贪心】
- vc++兼容不了win7的解决办法+c语言输入字符串的一些问题
- iOS开发-继承
- Android 的进程, 线程和任务
- 112 web dns理论
- zoj1610Count the Colors【暴力 or 线段树】
- 最短路径算法1—多源点Floyd
- iOS开发-基本数据类型,对象
- Linux(Centos6.5)下安装svn服务器,并通过http访问
- “对象被多次指定;已忽略多余的指定”并伴有"无法解析的外部符号 "xxx",该符号在函数 "xxx"中被引用的错误"
- Unity3D游戏引擎最详尽基础教程
- String类的实现
- hdoj 5240 Exam
- poj1094Sorting It All Out(拓扑排序)