G - Too Many Segments (hard version) （CodeForces - 1249D2）

最新推荐文章于 2020-07-15 21:42:52 发布

原创最新推荐文章于 2020-07-15 21:42:52 发布 · 317 阅读

本内容遵循CC 4.0 BY-SA版权协议

本文探讨了一个算法问题，目标是最小化需要删除的线段数量，以确保坐标轴上的所有整数点都不被超过k个线段覆盖。通过使用容器数据结构，文章提出了一种高效的解决方案，该方案遍历所有线段并维护一个活动线段集合，从而确定哪些线段的删除可以最有效地达到目标。

The only difference between easy and hard versions is constraints.

You are given n segments on the coordinate axis OX. Segments can intersect, lie inside each other and even coincide. The i-th segment is [li;ri] (li≤ri) and it covers all integer points jj such that li≤j≤ri.

The integer point is called bad if it is covered by strictly more than kk segments.

Your task is to remove the minimum number of segments so that there are no bad points at all.

Input

The first line of the input contains two integers n and k (1≤k≤n≤2⋅105) — the number of segments and the maximum number of segments by which each integer point can be covered.

The next n lines contain segments. The i-th line contains two integers li and ri (1≤li≤ri≤2⋅105) — the endpoints of the i-th segment.

Output

In the first line print one integer mm (0≤m≤n) — the minimum number of segments you need to remove so that there are no bad points.

In the second line print m distinct integers p1,p2,…,pm (1≤pi≤n) — indices of segments you remove in any order. If there are multiple answers, you can print any of them.

Examples

Input

Output

3
4 6 7

Input

Output

3
1 4 5

Input

Output

4
1 3 5 6

这一题用容器写会比较简单，首先存入数，从每个数的开头存，则最后的数就是要删的最佳选择，因为每个数都是连着的，最后的数就是最长的数。这个时候可以从1开始遍历，也可以求个最大最小值，缩小遍历值。

#include <stdio.h>
#include<string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int N=2e5+20;
struct node
{
    int y, id;
} ans[N];
vector<node>v[N];
set<node>s;
bool operator < (node a, node b)
{
    if(a.y == b.y)      
        return a.id < b.id;
    return a.y < b.y;
}
int a[N];
int main()
{
    int n, k;
    scanf("%d%d",&n,&k);
    for(int i=1; i<=n; i++)
    {
        node t;
        int a, b;
        scanf("%d%d",&a,&b);
        t.id = i;
        t.y = b;
        v[a].push_back(t);
    }
    int cnt=0;
    for(int i=1; i<mx; i++)
    {
        while(s.size()&&(*s.begin()).y<i)      
                s.erase(*s.begin());
        for(int j=0; j<v[i].size(); j++)   
                 s.insert(v[i][j]);
        while(s.size()>k)
        {
            ans[++cnt] = *s.rbegin();
            s.erase(*s.rbegin());
        }
    }
    printf("%d\n",cnt);
    for(int i=1; i<=cnt; i++)
    {
        printf("%d%c",ans[i].id,i==cnt?'\n':' ');
    }
    return 0;
}