H - H （CodeForces-612D）（排序+区间计数）

最新推荐文章于 2021-06-14 22:54:33 发布

Stephencurry‘s csdn

最新推荐文章于 2021-06-14 22:54:33 发布

阅读量166

点赞数

分类专栏：思路骚操作算法个人赛和组队赛补题文章标签：区间覆盖和计数

本文链接：https://blog.csdn.net/weixin_43846139/article/details/105747315

版权

思路同时被 3 个专栏收录

34 篇文章 0 订阅

订阅专栏

个人赛和组队赛补题

33 篇文章 0 订阅

订阅专栏

骚操作算法

28 篇文章 2 订阅

订阅专栏

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 l i, r i ( - 109 ≤ l i ≤ r i ≤ 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 a j, b j ( a j ≤ b j) — the ends of j-th segment in the answer. The segments should be listed in the order from left to right.

Examples

Input

Output

2
0 2
3 5

Input

Output

1
0 5

题意：给出n条线段，让你算这些线段重合次数大于等于k次的部分。

思路：这道题的话，是一道区间覆盖的问题，我们可以在存数时把左端点记做1，右端点记做-1，代表在这个线段内是被覆盖一次的，这样处理后共有2*n个点。当第一次到k次时，就记录下左端点，同理，第一次小于k就是答案的右端，还有就是一个点被覆盖k次时也算是一个答案。

AC代码：

#include <stdio.h>
#include <string>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <map>
#include <set>
typedef long long ll;
const int maxx=2000010;
const int mod=1000000007;
const int inf=0x3f3f3f3f;
const double eps=1e-8;
using namespace std;
struct node1
{
    int x,y;
} edge[maxx];
bool cmp(node1 a,node1 b)
{
    if(a.x==b.x)
        return a.y>b.y;
    return a.x<b.x;
}
struct node2
{
    int x1,y1;
} edge1[maxx];
int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k))
    {
        memset(edge,0,sizeof(edge));
        memset(edge1,0,sizeof(edge1));
        for(int i=0; i<2*n; i+=2)
        {
            scanf("%d%d",&edge[i].x,&edge[i+1].x);
            edge[i].y=1;
            edge[i+1].y=-1;
        }
        sort(edge,edge+2*n,cmp);
        int ans=0,cnt=0;
        int flag=0;
        for(int i=0; i<2*n; i++)
        {
            ans+=edge[i].y;
            if(ans>=k && flag==0)
            {
                edge1[cnt].x1=edge[i].x;
                flag=1;
            }
            else if(ans<k && flag==1)
            {
                edge1[cnt++].y1=edge[i].x;
                flag=0;
            }
        }
        printf("%d\n",cnt);
        for(int i=0; i<cnt; i++)
            printf("%d %d\n",edge1[i].x1,edge1[i].y1);
    }
    return 0;
}