(CodeForces
来源:互联网 发布:javlibrary新域名 12 编辑:程序博客网 时间:2024/06/15 22:24
(CodeForces - 612D)The Union of k-Segments
time limit per test:4 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output
You are given n segments on the coordinate axis Ox and the number k. The point is satisfied if it belongs to at least k segments. Find the smallest (by the number of segments) set of segments on the coordinate axis Ox which contains all satisfied points and no others.
Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 106) — the number of segments and the value of k.
The next n lines contain two integers li, ri ( - 109 ≤ li ≤ ri ≤ 109) each — the endpoints of the i-th segment. The segments can degenerate and intersect each other. The segments are given in arbitrary order.
Output
First line contains integer m — the smallest number of segments.
Next m lines contain two integers aj, bj (aj ≤ bj) — the ends of j-th segment in the answer. The segments should be listed in the order from left to right.
Examples
Input
3 2
0 5
-3 2
3 8
Output
2
0 2
3 5
Input
3 2
0 5
-3 3
3 8
Output
1
0 5
题目大意:给出n个线段问至少被覆盖k次的点的集合。
思路:将线段排序,用cnt从左到右计数,碰到左括号+1,碰到右括号-1,如果cnt等于k时输出左右括号的端点值就是所要的答案。(可以在草稿纸上划一下验证)
#include<cstdio>#include<algorithm>using namespace std;const int maxn=1000005;int ans[maxn<<1];struct node{ int left,x;}a[maxn<<1];bool cmp(node a,node b){ return ((a.x<b.x)||((a.x==b.x)&&a.left>b.left));}int main(){ int n,k; while(~scanf("%d%d",&n,&k)) { int tot=0; for(int i=0;i<n;i++) { int l,r; scanf("%d%d",&l,&r); a[tot].x=l; a[tot++].left=1; a[tot].x=r; a[tot++].left=0; } sort(a,a+tot,cmp); int cnt=0,tot1=0; for(int i=0;i<tot;i++) { if(a[i].left) { cnt++; if(cnt==k) ans[tot1++]=a[i].x; } else { if(cnt==k) ans[tot1++]=a[i].x; cnt--; } } printf("%d\n",tot1/2); for(int i=0;i<tot1;i+=2) printf("%d %d\n",ans[i],ans[i+1]); } return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- 进程间通信——管道
- 11.笔记go语言——内存分配器
- [深度学习论文笔记][ICCV 17 oral]Binarized Convolutional Landmark Localizers for Human Pose Estimation and...
- [[NSBundle mainBundle]pathForResource..取值为空
- 指南
- (CodeForces
- export.source定义的变量的作用域
- JZOJ 5390. 【NOIP2017提高A组模拟9.26】逗气
- BBB学习(一):BBB相关文档及链接(实时更新)
- C语言中手把手教你动态内存分配
- 图像处理自适应滤波
- 编程理解——翻转前k个字符
- JSP页面调用接口发送JSON格式数据
- JAVA Freemarker(6)--自定义指令