ZOJ
来源:互联网 发布:键盘 编程 编辑:程序博客网 时间:2024/05/20 22:37
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
题意:每次操作给定一个区间 将区间中的颜色涂为k
思路:用线段树维护每一个区间的颜色 区间最大为8000 查询时记录下上一个数的颜色 不一样就更新
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int max_=8003;int tree[max_*4],num[max_],n,last;void pushdown(int rt){ if(tree[rt]!=-1) tree[rt<<1]=tree[rt<<1|1]=tree[rt]; tree[rt]=-1;}void updata(int ql,int qr,int c,int l,int r,int rt){ if(ql<=l&&qr>=r) { tree[rt]=c; return; } pushdown(rt); int m=(l+r)>>1; if(ql<=m) updata(ql,qr,c,l,m,rt<<1); if(qr>m) updata(ql,qr,c,m+1,r,rt<<1|1);}void query(int l,int r,int rt){ if(l==r){ if(tree[rt]!=-1&&tree[rt]!=last) num[tree[rt]]++; last=tree[rt]; return; } pushdown(rt); int m=(l+r)>>1; query(l,m,rt<<1); query(m+1,r,rt<<1|1);}int main(){ while(scanf("%d",&n)==1) { memset(tree,-1,sizeof(tree)); memset(num,0,sizeof(num)); int a,b,c; for(int i=0;i<n;i++) { scanf("%d%d%d",&a,&b,&c); if(a<b) updata(a+1,b,c,1,8000,1); } last=-1; query(1,8000,1); for(int i=0;i<=8000;i++) { if(num[i]) printf("%d %d\n",i,num[i]); } printf("\n"); } return 0;}
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- 数据分析系列目录
- 30. env
- ActiveMQ系列—ActiveMQ性能优化(下1)(消息存储方案 KahaDB)
- Hibernate框架中数据库多对多的演示
- SpringMVC 与Struts2的区别
- ZOJ
- java学习笔记--面向对象
- java 百度高德实现地址转经纬度
- AndroidStudio配置ndk环境
- Android 编译7.0sdk 应用时报错 (Unsupported class version number [52.0] (maximum 51.0, Java 1.7))处理
- 安防监控直播中无插件web直播方案中实现快照抓取的功能
- leetcode03. Find the Weak Connected Component in the Directed Graph
- msfvenom 生成shellcode
- Java练习