oj.uz

Submission #722547

# Submission time Handle Problem Language Result Execution time Memory
722547 2023-04-12T09:23:04 Z minhcool Event Hopping 2 (JOI21_event2) C++17
7 / 100
 217 ms 67788 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

int n, k;
int l[N], r[N];

iii seg[N];

int mini[N];
int nxt[N];
int eval[N][21];

bool cook[N];

int le[N], ri[N];
set<ii> seg1[N], seg2[N];
int comp[N];
//int mn_r[N];

int cal(int le, int ri){
	int temp = lower_bound(seg + 1, seg + n + 1, make_pair(make_pair(le, -oo), -oo)) - seg;
	if(temp == (n + 1)) return 0;
	temp = mini[temp];
	if(r[temp] > ri) return 0;
	int answer = 1;
	for(int i = 18; i >= 0; i--){
		if(eval[temp][i] == oo) continue;
		if(r[eval[temp][i]] <= ri){
			answer += (1LL << i);
			temp = eval[temp][i];
		}
	}
	return answer;
}

void process(){
	cin >> n >> k;
	for(int i = 1; i <= n; i++){
		cin >> seg[i].fi.fi >> seg[i].fi.se;
		seg[i].se = i;
		l[i] = seg[i].fi.fi, r[i] = seg[i].fi.se;
	}
	sort(seg + 1, seg + n + 1);
	mini[n + 1] = oo;	
	for(int i = n; i >= 1; i--){
		int temp = lower_bound(seg + 1, seg + n + 1, make_pair(make_pair(seg[i].fi.se, -oo), -oo)) - seg;
		if(temp == (n + 1)) nxt[seg[i].se] = oo;
		else nxt[seg[i].se] = mini[temp];
		mini[i] = mini[i + 1];
		if(i == n || seg[i].fi.se <= seg[mini[i]].fi.se) mini[i] = seg[i].se;
		eval[seg[i].se][0] = nxt[seg[i].se];
	}
	for(int i = 1; i <= 18; i++){
		for(int j = 1; j <= n; j++){
			if(eval[j][i - 1] == oo) eval[j][i] = oo;
			else eval[j][i] = eval[eval[j][i - 1]][i - 1];
		}
	}
	le[1] = 0, ri[1] = 1e9;
	for(int i = 1; i <= n; i++){
		seg1[1].insert({l[i], i});
		seg2[1].insert({r[i], i});
		comp[i] = 1;
	}
	int cur = cal(0, 1e9);
	//cout << cur << "\n";
	if(cur < k){
		cout << -1;
		return;
	}
	cur -= k;
	int tol_comp = 1;
	int num = 0;
	for(int i = 1; i <= n; i++){
		if(cook[i]) continue;
		cook[i] = 1;
		//if(l[i] < le[root] || r[i] > ri[root]) continue;
		int root = comp[i];
		int diff = cal(le[root], ri[root]);
		diff -= cal(le[root], l[i]) + cal(r[i], ri[root]) + 1;
		//cout << diff << "\n";
		assert(diff >= 0);
		if(cur < diff){
			seg1[comp[i]].erase({l[i], i});
			seg2[comp[i]].erase({r[i], i});
		//	cook[i] = 1;
			continue;
		}
		num++;
		cur -= diff;
		bool which = 0;
		set<ii>::iterator it1 = seg1[root].lower_bound({r[i], -oo}), it2 = seg2[root].lower_bound({l[i] + 1, -oo});
		if(it2 == seg2[root].begin()) which = 0;
		else{
			it2--;
			while(1){
				if(it1 == seg1[root].end()){
					which = 1;
					break;
				}
				if(it2 == seg2[root].begin()){
					which = 0;
					break;
				}
				it1++;
				it2--;
			}
		}
		if(!which){
			tol_comp++;
			le[tol_comp] = le[root], ri[tol_comp] = l[i];
			le[root] = r[i];
			set<ii>::iterator it1 = seg1[root].lower_bound({r[i], -oo}), it2 = seg2[root].lower_bound({l[i] + 1, -oo});
			vector<int> er;
			if(it2 != seg2[root].begin()){
				it2--;
				for(;; it2--){
					er.pb((*it2).se);
					if(it2 == seg2[root].begin()) break;
				}
			}
			for(auto it : er){
				comp[it] = tol_comp;
				seg1[root].erase({l[it], it});
				seg2[root].erase({r[it], it});
				seg1[tol_comp].insert({l[it], it});
				seg2[tol_comp].insert({r[it], it});
			}
			er.clear();
			it1 = seg1[root].begin();
			for(; it1 != seg1[root].end(); it1++){
				if((*it1).fi >= r[i]) break;
				er.pb((*it1).se);
			}
			for(auto it : er){
				cook[it] = 1;
				seg1[root].erase({l[it], it});
				seg2[root].erase({r[it], it});
			}
		}
		else{
			tol_comp++;
			le[tol_comp] = r[i], ri[tol_comp] = ri[root];
			ri[root] = l[i];
			set<ii>::iterator it1 = seg1[root].lower_bound({r[i], -oo});
			vector<int> er;
			for(; it1 != seg1[root].end(); it1++){
				er.pb((*it2).se);
				if(it2 == seg2[root].begin()) break;
			}
			for(auto it : er){
				comp[it] = tol_comp;
				seg1[root].erase({l[it], it});
				seg2[root].erase({r[it], it});
				seg1[tol_comp].insert({l[it], it});
				seg2[tol_comp].insert({r[it], it});
			}
			er.clear();
			if(seg2[root].size()){
				it1 = seg2[root].end();
				it1--;
				for(; ; it1--){
					if((*it1).fi <= l[i]) break;
					er.pb((*it1).se);
					if(it1 == seg2[root].begin()) break;
				}
				for(auto it : er){
					cook[it] = 1;
					seg1[root].erase({l[it], it});
					seg2[root].erase({r[it], it});
				}
			}
		}
		cout << i << "\n";
		if(num == k) break;
	}
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 28500 KB Output is correct
2 Correct 18 ms 28468 KB Output is correct
3 Correct 14 ms 28560 KB Output is correct
4 Correct 217 ms 66016 KB Output is correct
5 Correct 196 ms 67668 KB Output is correct
6 Correct 205 ms 67588 KB Output is correct
7 Correct 194 ms 67380 KB Output is correct
8 Correct 200 ms 67788 KB Output is correct
9 Correct 201 ms 67640 KB Output is correct
10 Correct 199 ms 67696 KB Output is correct
11 Correct 190 ms 67348 KB Output is correct
12 Correct 179 ms 67008 KB Output is correct
13 Correct 188 ms 67000 KB Output is correct
14 Correct 180 ms 66904 KB Output is correct
15 Correct 156 ms 66728 KB Output is correct
16 Correct 142 ms 66152 KB Output is correct
17 Correct 150 ms 65960 KB Output is correct
18 Correct 133 ms 65964 KB Output is correct
19 Correct 137 ms 65740 KB Output is correct
20 Correct 138 ms 65820 KB Output is correct
21 Correct 125 ms 65836 KB Output is correct
22 Correct 137 ms 65840 KB Output is correct
23 Correct 153 ms 65824 KB Output is correct
24 Correct 138 ms 65712 KB Output is correct
25 Correct 143 ms 65952 KB Output is correct
26 Correct 149 ms 65904 KB Output is correct
27 Correct 151 ms 65936 KB Output is correct
28 Correct 121 ms 65636 KB Output is correct
29 Correct 107 ms 65612 KB Output is correct
30 Correct 110 ms 65676 KB Output is correct
31 Correct 133 ms 65704 KB Output is correct
32 Correct 124 ms 65720 KB Output is correct
33 Correct 123 ms 65692 KB Output is correct
34 Correct 159 ms 66540 KB Output is correct
35 Correct 142 ms 66200 KB Output is correct
36 Correct 117 ms 65968 KB Output is correct
37 Correct 183 ms 66812 KB Output is correct
38 Correct 177 ms 66728 KB Output is correct
39 Correct 164 ms 66884 KB Output is correct
40 Correct 164 ms 66636 KB Output is correct
41 Correct 183 ms 66660 KB Output is correct
42 Correct 140 ms 65612 KB Output is correct
43 Correct 165 ms 66776 KB Output is correct
44 Correct 179 ms 66728 KB Output is correct
45 Correct 166 ms 66696 KB Output is correct
46 Correct 165 ms 66824 KB Output is correct

Subtask #2
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28528 KB Output is correct
2 Correct 16 ms 28500 KB Output is correct
3 Correct 18 ms 28500 KB Output is correct
4 Incorrect 20 ms 28536 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28528 KB Output is correct
2 Correct 16 ms 28500 KB Output is correct
3 Correct 18 ms 28500 KB Output is correct
4 Incorrect 20 ms 28536 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 28500 KB Output is correct
2 Correct 18 ms 28468 KB Output is correct
3 Correct 14 ms 28560 KB Output is correct
4 Correct 217 ms 66016 KB Output is correct
5 Correct 196 ms 67668 KB Output is correct
6 Correct 205 ms 67588 KB Output is correct
7 Correct 194 ms 67380 KB Output is correct
8 Correct 200 ms 67788 KB Output is correct
9 Correct 201 ms 67640 KB Output is correct
10 Correct 199 ms 67696 KB Output is correct
11 Correct 190 ms 67348 KB Output is correct
12 Correct 179 ms 67008 KB Output is correct
13 Correct 188 ms 67000 KB Output is correct
14 Correct 180 ms 66904 KB Output is correct
15 Correct 156 ms 66728 KB Output is correct
16 Correct 142 ms 66152 KB Output is correct
17 Correct 150 ms 65960 KB Output is correct
18 Correct 133 ms 65964 KB Output is correct
19 Correct 137 ms 65740 KB Output is correct
20 Correct 138 ms 65820 KB Output is correct
21 Correct 125 ms 65836 KB Output is correct
22 Correct 137 ms 65840 KB Output is correct
23 Correct 153 ms 65824 KB Output is correct
24 Correct 138 ms 65712 KB Output is correct
25 Correct 143 ms 65952 KB Output is correct
26 Correct 149 ms 65904 KB Output is correct
27 Correct 151 ms 65936 KB Output is correct
28 Correct 121 ms 65636 KB Output is correct
29 Correct 107 ms 65612 KB Output is correct
30 Correct 110 ms 65676 KB Output is correct
31 Correct 133 ms 65704 KB Output is correct
32 Correct 124 ms 65720 KB Output is correct
33 Correct 123 ms 65692 KB Output is correct
34 Correct 159 ms 66540 KB Output is correct
35 Correct 142 ms 66200 KB Output is correct
36 Correct 117 ms 65968 KB Output is correct
37 Correct 183 ms 66812 KB Output is correct
38 Correct 177 ms 66728 KB Output is correct
39 Correct 164 ms 66884 KB Output is correct
40 Correct 164 ms 66636 KB Output is correct
41 Correct 183 ms 66660 KB Output is correct
42 Correct 140 ms 65612 KB Output is correct
43 Correct 165 ms 66776 KB Output is correct
44 Correct 179 ms 66728 KB Output is correct
45 Correct 166 ms 66696 KB Output is correct
46 Correct 165 ms 66824 KB Output is correct
47 Correct 17 ms 28528 KB Output is correct
48 Correct 16 ms 28500 KB Output is correct
49 Correct 18 ms 28500 KB Output is correct
50 Incorrect 20 ms 28536 KB Output isn't correct
51 Halted 0 ms 0 KB -