B2. Books Exchange (hard version) cf1249

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
The only difference between easy and hard versions is constraints.

There are n kids, each of them is reading a unique book. At the end of any day, the i-th kid will give his book to the pi-th kid (in case of i=pi the kid will give his book to himself). It is guaranteed that all values of pi are distinct integers from 1 to n (i.e. p is a permutation). The sequence p doesn’t change from day to day, it is fixed.

For example, if n=6 and p=[4,6,1,3,5,2] then at the end of the first day the book of the 1-st kid will belong to the 4-th kid, the 2-nd kid will belong to the 6-th kid and so on. At the end of the second day the book of the 1-st kid will belong to the 3-th kid, the 2-nd kid will belong to the 2-th kid and so on.

Your task is to determine the number of the day the book of the i-th child is returned back to him for the first time for every i from 1 to n.

Consider the following example: p=[5,1,2,4,3]. The book of the 1-st kid will be passed to the following kids:

after the 1-st day it will belong to the 5-th kid,
after the 2-nd day it will belong to the 3-rd kid,
after the 3-rd day it will belong to the 2-nd kid,
after the 4-th day it will belong to the 1-st kid.
So after the fourth day, the book of the first kid will return to its owner. The book of the fourth kid will return to him for the first time after exactly one day.

You have to answer q independent queries.

Input
The first line of the input contains one integer q (1≤q≤1000) — the number of queries. Then q queries follow.

The first line of the query contains one integer n (1≤n≤2⋅105) — the number of kids in the query. The second line of the query contains n integers p1,p2,…,pn (1≤pi≤n, all pi are distinct, i.e. p is a permutation), where pi is the kid which will get the book of the i-th kid.

It is guaranteed that ∑n≤2⋅105 (sum of n over all queries does not exceed 2⋅105).

Output
For each query, print the answer on it: n integers a1,a2,…,an, where ai is the number of the day the book of the i-th child is returned back to him for the first time in this query.

Example
inputCopy
6
5
1 2 3 4 5
3
2 3 1
6
4 6 2 1 5 3
1
1
4
3 4 1 2
5
5 1 2 4 3
outputCopy
1 1 1 1 1
3 3 3
2 3 3 2 1 3
1
2 2 2 2
4 4 4 1 4

#include<iostream>
using namespace std;
int a[500]; 
int main(){
	int q,n,i,j,t,b;

	cin>>q;
	for( i=0;i<q;i++){
		cin>>n;
		for( j=1;j<=n;j++){
			cin>>a[j];
		}
		for( j=1;j<=n;j++){
		t=1,b=a[j];
			while(b!=j){
				b=a[b];
				t+=1;
			}
			cout<<t<<" ";
		}
		cout<<endl;		
	}
}

先做的这道
时间爆了，想了很久才想出来可以用二分
但是思路混乱了，托了很多节奏

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
int y=0;
int a[1000010];
void dfs(int x,int z)
{
    if(x==z)
        return ;
        y++;
    dfs(a[x],z);
}
int main()
 
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int m;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=m;i++)
        {
            y=1;
           dfs(a[i],i);
           printf("%d",y);
           if(i!=m)
            printf(" ");
        }
        printf("\n");
    }
    return 0;
}

二分再想想

在这里插入代码片

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 j such that li≤j≤ri.

The integer point is called bad if it is covered by strictly more than k 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≤200) — 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≤200) — the endpoints of the i-th segment.

Output
In the first line print one integer m (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
7 2
11 11
9 11
7 8
8 9
7 8
9 11
7 9
Output
3
1 4 7
Input
5 1
29 30
30 30
29 29
28 30
30 30
Output
3
1 2 4
Input
6 1
2 3
3 3
2 3
2 2
2 3
2 3
Output
4
1 3 5 6
跟一道D题，还是当时学的不够细，以为自己懂了，但是思维能力自己还是没法想出来。

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int N=2e5+10;
int n,k;
struct Node
{
	int y;
	int idx;
};
bool operator<(Node a,Node b)//排序
{
	if(a.y!=b.y)
		return a.y<b.y;
	return a.idx<b.idx;
}
vector<Node> g[N];
vector<int> ans;

int main()
{
	int x,y;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		Node p;
		scanf("%d%d",&x,&y);
		p.y=y;
		p.idx=i;
		g[x].push_back(p);
	}
	set<Node> s;
	for(int i=1;i<N;i++)
	{
		while(s.size()&&(*s.begin()).y<i)
			s.erase(*s.begin());

		for(int j=0;j<g[i].size();j++)
			s.insert(g[i][j]);

		while(s.size()>k)
		{
			ans.push_back((*s.rbegin()).idx);
			s.erase(*s.rbegin());
		}
	}
	printf("%d\n",ans.size());
	int len=ans.size();
	for(int i=0;i<len;i++)
	{
		printf("%d%c",ans[i],i==len-1?'\n':' ');
	}
	return 0;
}