荔园在线
荔园之美，在春之萌芽，在夏之绽放，在秋之收获，在冬之沉淀
[回到开始]
[上一篇][下一篇]
发信人: huhaiming (一生只爱她), 信区: Program
标 题: problem C
发信站: 荔园晨风BBS站 (Sat May 24 20:05:01 2003), 站内信件
Count the Colors
Time limit: 1 Seconds Memory limit: 32768K
Total Submit: 0 Accepted Submit: 0
------------------------------------------------------------------------
--------
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: Standlove
------------------------------------------------------------------------
--------
Submit Back Status
------------------------------------------------------------------------
--------
Zhejiang University Online Judge V1.0
--
菩提本无树，明镜亦非台
本来无一物，何处惹尘埃
※ 来源:·荔园晨风BBS站 bbs.szu.edu.cn·[FROM: 192.168.0.200]
[回到开始]
[上一篇][下一篇]
荔园在线首页 友情链接：深圳大学 深大招生 荔园晨风BBS S-Term软件 网络书店