oj.uz

Submission #947033

# Submission time Handle Problem Language Result Execution time Memory
947033 2024-03-15T11:41:25 Z vjudge1 Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 24756 KB 
#include<bits/stdc++.h>
using namespace std;
const long long maxn=200000+10;
vector<long long>res;
long long n,k;
pair<long long,long long>all[maxn];
vector<long long>alll[maxn],allr[maxn];

void vorod(){
	cin>>n>>k;
	vector<long long>allind;
	for(long long i=1;i<=n;i++){
		cin>>all[i].first>>all[i].second;
		all[i].second--;
		allind.push_back(all[i].first);
		allind.push_back(all[i].second);
	}
	sort(allind.begin(),allind.end());
	allind.resize(unique(allind.begin(),allind.end())-allind.begin());
	for(long long i=1;i<=n;i++){
		all[i].first=lower_bound(allind.begin(),allind.end(),all[i].first)-allind.begin();
		all[i].second=lower_bound(allind.begin(),allind.end(),all[i].second)-allind.begin();
		alll[all[i].first].push_back(i);
		allr[all[i].second].push_back(i);
	}
}
vector<pair<long long,long long>>allv;
set<pair<int,int>>inds;
void pre(){
	set<pair<long long,long long>>st;
	for(long long i=0;i<maxn;i++){
		long long mn=maxn+2;
		for(auto x:alll[i]){
			mn=min(mn,all[x].second);
		}
		while((long long)st.size()>0&&(*st.rbegin()).first>=mn){
			st.erase(*st.rbegin());
		}
		for(auto x:alll[i]){
			if(all[x].second==mn){
				st.insert(make_pair(all[x].second,x));
				mn=-1;
			}
		}
		for(auto x:allr[i]){
			if(st.count(make_pair(i,x))==1){
				st.erase(make_pair(i,x));
				allv.push_back(make_pair(all[x].first,all[x].second));
			}
		}
	}
}

bool eshy(long long l,long long r,long long ll,long long rr){
	if(l>ll){
		swap(l,ll);
		swap(r,rr);
	}
	return ll<=r;
}

bool esh(long long a,long long b){
	return eshy(all[a].first,all[a].second,all[b].first,all[b].second);
}

long long cal(){
	long long ret=0,r=-1;
	for(auto x:allv){
		long long f=1;
		auto z=inds.lower_bound(make_pair(x.first,x.first));
		if((int)inds.size()>0&&(*inds.rbegin()).first>=x.first){
			if(eshy(x.first,x.second,(*z).first,(*z).second)){
				f=0;
			}
		}
		if((int)inds.size()>0&&(*inds.begin()).first<x.first){
			z--;
			if(eshy(x.first,x.second,(*z).first,(*z).second)){
				f=0;
			}
		}
		if(x.first<=r||f==0){
			continue;
		}
		ret++;
		r=x.second;
	}
	return ret;
}

void can(long long i){
	for(auto x:res){
		if(esh(x,i)){
			return ;
		}
	}
	inds.insert(make_pair(all[i].first,all[i].second));
	res.push_back(i);
	if(cal()+(long long)res.size()<k){
		res.pop_back();
		inds.erase(make_pair(all[i].first,all[i].second));
	}
}

void solve(){
	for(long long i=1;i<=n;i++){
		if((long long)res.size()==k){
			break;
		}
		can(i);
	}
}

void khor(){
	if((long long)res.size()<k){
		cout<<-1<<"\n";
		return ;
	}
	for(auto x:res){
		cout<<x<<"\n";
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//cout.tie(0);
	//freopen("inp.txt","r",stdin);
	vorod();
	pre();
	solve();
	khor();
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10840 KB Output is correct
2 Correct 3 ms 10840 KB Output is correct
3 Correct 3 ms 10840 KB Output is correct
4 Execution timed out 3101 ms 24756 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10844 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 4 ms 10844 KB Output is correct
5 Correct 3 ms 10844 KB Output is correct
6 Correct 4 ms 10844 KB Output is correct
7 Correct 3 ms 11100 KB Output is correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 3 ms 10840 KB Output is correct
11 Correct 3 ms 10840 KB Output is correct
12 Correct 3 ms 10844 KB Output is correct
13 Correct 3 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 3 ms 10840 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 3 ms 10896 KB Output is correct
18 Correct 3 ms 10844 KB Output is correct
19 Correct 3 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 3 ms 10844 KB Output is correct
22 Correct 3 ms 10844 KB Output is correct
23 Correct 3 ms 10844 KB Output is correct
24 Correct 3 ms 10844 KB Output is correct
25 Correct 3 ms 10884 KB Output is correct
26 Correct 4 ms 10844 KB Output is correct
27 Correct 3 ms 10668 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10844 KB Output is correct
2 Correct 3 ms 10844 KB Output is correct
3 Correct 2 ms 10844 KB Output is correct
4 Correct 4 ms 10844 KB Output is correct
5 Correct 3 ms 10844 KB Output is correct
6 Correct 4 ms 10844 KB Output is correct
7 Correct 3 ms 11100 KB Output is correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 3 ms 10840 KB Output is correct
11 Correct 3 ms 10840 KB Output is correct
12 Correct 3 ms 10844 KB Output is correct
13 Correct 3 ms 10844 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 3 ms 10840 KB Output is correct
16 Correct 3 ms 10844 KB Output is correct
17 Correct 3 ms 10896 KB Output is correct
18 Correct 3 ms 10844 KB Output is correct
19 Correct 3 ms 10844 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 3 ms 10844 KB Output is correct
22 Correct 3 ms 10844 KB Output is correct
23 Correct 3 ms 10844 KB Output is correct
24 Correct 3 ms 10844 KB Output is correct
25 Correct 3 ms 10884 KB Output is correct
26 Correct 4 ms 10844 KB Output is correct
27 Correct 3 ms 10668 KB Output is correct
28 Correct 5 ms 11156 KB Output is correct
29 Correct 5 ms 11116 KB Output is correct
30 Correct 5 ms 11100 KB Output is correct
31 Correct 5 ms 11100 KB Output is correct
32 Correct 5 ms 11100 KB Output is correct
33 Correct 8 ms 11100 KB Output is correct
34 Correct 6 ms 11096 KB Output is correct
35 Correct 426 ms 11228 KB Output is correct
36 Correct 380 ms 11312 KB Output is correct
37 Correct 266 ms 11252 KB Output is correct
38 Correct 62 ms 11100 KB Output is correct
39 Correct 356 ms 11232 KB Output is correct
40 Correct 307 ms 11272 KB Output is correct
41 Correct 264 ms 11280 KB Output is correct
42 Correct 63 ms 11096 KB Output is correct
43 Correct 116 ms 11100 KB Output is correct
44 Correct 96 ms 11220 KB Output is correct
45 Correct 72 ms 11100 KB Output is correct
46 Correct 61 ms 11100 KB Output is correct
47 Correct 14 ms 11100 KB Output is correct
48 Correct 10 ms 11096 KB Output is correct
49 Correct 7 ms 11096 KB Output is correct
50 Correct 24 ms 11100 KB Output is correct
51 Correct 7 ms 11100 KB Output is correct
52 Correct 6 ms 11096 KB Output is correct
53 Correct 5 ms 11096 KB Output is correct
54 Correct 10 ms 11188 KB Output is correct
55 Correct 336 ms 11396 KB Output is correct
56 Correct 309 ms 11244 KB Output is correct
57 Correct 338 ms 11344 KB Output is correct
58 Correct 303 ms 11348 KB Output is correct
59 Correct 293 ms 11236 KB Output is correct
60 Correct 284 ms 11348 KB Output is correct
61 Correct 275 ms 11344 KB Output is correct
62 Correct 274 ms 11552 KB Output is correct
63 Correct 222 ms 11300 KB Output is correct
64 Correct 56 ms 11096 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10840 KB Output is correct
2 Correct 3 ms 10840 KB Output is correct
3 Correct 3 ms 10840 KB Output is correct
4 Execution timed out 3101 ms 24756 KB Time limit exceeded
5 Halted 0 ms 0 KB -