oj.uz

Submission #405575

# Submission time Handle Problem Language Result Execution time Memory
405575 2021-05-16T14:42:54 Z dvdg6566 Event Hopping 2 (JOI21_event2) C++14
32 / 100
 3000 ms 19928 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define f first 
#define s second
#define mp make_pair
#define SZ(x) (ll)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
#define ub upper_bound

const int MAXN = 200100;
const int MAXK = 19;
int L[MAXN][MAXK];
vpi V;
vi des;
int N,a,b,M,K;

int eval(int x,int y){
	int ans=0;
	// for(int k=MAXK-1;k>=0;--k)if(x<=y){
	// 	if(L[x][k]-1<=y){
	// 		x = L[x][k] + 1;
	// 		ans += (1<<k);
	// 	}
	// }
	while(x<=y&&L[x][0]-1<=y){ // fits within (x,y)
		x = L[x][0];
		++ans;
	}
	return ans;
}

set<pair<pi,int>> S;

int main(){
	cin>>N>>K;
	for(int i=0;i<N;++i){
		cin>>a>>b;
		--b;
		V.pb(a,b);
		des.pb(a);des.pb(b);
	}
	sort(ALL(des));des.resize(unique(ALL(des))-des.begin());
	for(auto &i:V){
		i.f = lb(ALL(des),i.f) - des.begin();
		i.s = lb(ALL(des),i.s) - des.begin();
	}
	vpi T;
	for(auto i:V)T.pb(i);
	sort(ALL(T));
	M=SZ(des)-1; // run from 0 to M-1	
	ll rc=1e9;
	for(int i=M;i>=0;--i){
		while(SZ(T)&&T.back().f>=i){
			rc=min(rc,T.back().s);
			T.pop_back();
		}
		L[i][0]=rc+1;
		for(int k=1;k<MAXK;++k){
			if(L[i][k-1] >= 1e9)continue;
			int t=L[i][k-1];
			++t;
			L[i][k] = L[t][k-1];
		}
	}
	int tot=eval(0,M);
	// cerr<<tot<<'\n';
	if(tot<K){
		cout<<-1<<'\n';
		return 0;
	}
	
	S.insert(mp(mp(-1,-1),-1));
	S.insert(mp(mp(0,M),tot));

	vi ans;
	for(int i=0;i<N;++i){
		a = V[i].f;
		b = V[i].s;
		auto x = --S.ub(mp(mp(a,1e9),-1e9));
		pi rng=x->f;
		int w=x->s;
		if(rng.f>a)assert(0);
		if(rng.s<b)continue;
		// rng.f, a, b, rng.s
		int c=eval(rng.f,a-1);
		int d=eval(b+1,rng.s);
		int nv=c+d;
		if(tot-w+1+nv<K)continue; // cannot take
		tot = tot-w+1+nv;
		ans.pb(i+1);
		S.erase(x);
		if(c)S.insert(mp(mp(rng.f,a-1),c));
		if(d)S.insert(mp(mp(b+1,rng.s),d));
		// cerr<<"Ins "<<i+1<<'\n';
	}
	while(SZ(ans)>K)ans.pop_back();
	for(auto i:ans)cout<<i<<'\n';
}

Subtask #1
0 / 7.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 5 ms 960 KB Output is correct
29 Correct 6 ms 972 KB Output is correct
30 Correct 8 ms 972 KB Output is correct
31 Correct 6 ms 972 KB Output is correct
32 Correct 6 ms 972 KB Output is correct
33 Correct 6 ms 920 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 8 ms 1024 KB Output is correct
36 Correct 8 ms 972 KB Output is correct
37 Correct 8 ms 972 KB Output is correct
38 Correct 6 ms 972 KB Output is correct
39 Correct 7 ms 972 KB Output is correct
40 Correct 7 ms 996 KB Output is correct
41 Correct 7 ms 972 KB Output is correct
42 Correct 6 ms 972 KB Output is correct
43 Correct 6 ms 972 KB Output is correct
44 Correct 6 ms 972 KB Output is correct
45 Correct 6 ms 972 KB Output is correct
46 Correct 5 ms 972 KB Output is correct
47 Correct 6 ms 972 KB Output is correct
48 Correct 6 ms 972 KB Output is correct
49 Correct 5 ms 872 KB Output is correct
50 Correct 6 ms 924 KB Output is correct
51 Correct 5 ms 972 KB Output is correct
52 Correct 7 ms 972 KB Output is correct
53 Correct 6 ms 972 KB Output is correct
54 Correct 5 ms 972 KB Output is correct
55 Correct 24 ms 988 KB Output is correct
56 Correct 23 ms 988 KB Output is correct
57 Correct 24 ms 984 KB Output is correct
58 Correct 23 ms 988 KB Output is correct
59 Correct 26 ms 972 KB Output is correct
60 Correct 24 ms 988 KB Output is correct
61 Correct 24 ms 980 KB Output is correct
62 Correct 26 ms 984 KB Output is correct
63 Correct 23 ms 964 KB Output is correct
64 Correct 5 ms 972 KB Output is correct

Subtask #4
0 / 61.0

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