제출 #1160953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160953		mertbbm	Event Hopping 2 (JOI21_event2)	C++20	7 / 100	146 ms	35508 KiB

event2

#include <bits/stdc++.h>
using namespace std;
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,int>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

inline int combine(int a, int b){
	return min(a,b);
}

struct node{
	int s,e,m;
	node *l,*r;
	int v;
	
	node(int ss, int ee):s(ss),e(ee),m((s+e)>>1),v(1e15){
		if(s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	
	void upd(int x, int y){
		if(s==e){
			v=y;
			return;
		}
		if(x<=m) l->upd(x,y);
		else r->upd(x,y);
		v=combine(l->v,r->v);
	}
	
	int query(int x, int y){
		if(x<=s&&y>=e){
			return v;
		}
		if(y<=m) return l->query(x,y);
		if(x>m) return r->query(x,y);
		return combine(l->query(x,m),r->query(m+1,y));
	}
};

void solve(){
	int n,k;
	cin >> n >> k;
	
	pii arr[n];
	vector<int>dis;
	for(int x=0;x<n;x++){
		cin >> arr[x].first >> arr[x].second;
		dis.push_back(arr[x].first);
		dis.push_back(arr[x].second);
	}
	
	sort(dis.begin(),dis.end());
	dis.resize(unique(dis.begin(),dis.end())-dis.begin());
	vector<int>storage[2*n+5];
	vector<int>storage2[2*n+5];
	
	for(int x=0;x<n;x++){
		arr[x].first=lower_bound(dis.begin(),dis.end(),arr[x].first)-dis.begin()+1;
		arr[x].second=lower_bound(dis.begin(),dis.end(),arr[x].second)-dis.begin()+1;
		storage[arr[x].first].push_back(arr[x].second);
		storage2[arr[x].first].push_back(x);
	}
	
	int dp[2*n+5];
	memset(dp,0,sizeof(dp));

	for(int x=2*n;x>=1;x--){
		dp[x]=max(dp[x],dp[x+1]);
		for(auto it:storage[x]){
			dp[x]=max(dp[x],dp[it]+1);
		}
	}
	
	//show4(dp,dp);
	
	if(dp[1]<k){
		cout << -1;
		return;
	}
	
	node st(0,n+5);
	for(int x=0;x<n;x++){
		st.upd(x,arr[x].second);
	}
	
	vector<int>ans;
	
	int ptr=0;
	
	for(int x=0;x<k;x++){
		int l=0;
		int r=n-1;
		int mid;
		int best=n;
		
		while(l<=r){
			mid=(l+r)/2;
			int hold=st.query(0,mid);
			if(hold<=2*n&&1+dp[hold]>=k-x){
				best=mid;
				r=mid-1;
			}
			else l=mid+1;
		}
		
		int hold=st.query(0,best);
		while(ptr<hold){
			for(auto it:storage2[ptr]){
				st.upd(it,1e15);
			}
			ptr++;
		}
		ans.push_back(best+1);
	}
	
	sort(ans.begin(),ans.end());
	for(auto it:ans) cout << it << "\n";
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("lineup.in","r",stdin);
	//freopen("lineup.out","w",stdout);
	int t=1;	
	//cin >> t;	
	while(t--){
		solve(); 
	}
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 1
• Subtask 3: 0 / 31
• Subtask 4: 0 / 61