oj.uz

Submission #722556

# Submission time Handle Problem Language Result Execution time Memory
722556 2023-04-12T09:38:51 Z minhcool Event Hopping 2 (JOI21_event2) C++17
100 / 100
 584 ms 67996 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];
	//cout << temp << "\n";
	if(r[temp] > ri) return 0;
	int answer = 1;
	for(int i = 18; i >= 0; i--){
		//cout << eval[temp][i] << "\n";
		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--){
		mini[i] = mini[i + 1];
		if(i == n || seg[i].fi.se <= r[mini[i]]) mini[i] = seg[i].se;
		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];
		if(nxt[seg[i].se] == seg[i].se) nxt[seg[i].se] = oo;
		//cout << i << " " << temp << " " << nxt[seg[i].se] << "\n";
		//cout << seg[i].se << " " << temp << " " << nxt[seg[i].se] << "\n";
		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";
	//exit(0);
	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((*it1).se);
				//if(it1 == 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);
	//freopen("event.inp", "r", stdin);
	//freopen("event.out", "w", stdout);
	cin.tie(0);
	process();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 28500 KB Output is correct
2 Correct 13 ms 28460 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 209 ms 65836 KB Output is correct
5 Correct 192 ms 65732 KB Output is correct
6 Correct 189 ms 65620 KB Output is correct
7 Correct 181 ms 65432 KB Output is correct
8 Correct 198 ms 65928 KB Output is correct
9 Correct 193 ms 65820 KB Output is correct
10 Correct 185 ms 65612 KB Output is correct
11 Correct 175 ms 65420 KB Output is correct
12 Correct 163 ms 65008 KB Output is correct
13 Correct 164 ms 65044 KB Output is correct
14 Correct 162 ms 64944 KB Output is correct
15 Correct 153 ms 64896 KB Output is correct
16 Correct 130 ms 64076 KB Output is correct
17 Correct 132 ms 64104 KB Output is correct
18 Correct 128 ms 64080 KB Output is correct
19 Correct 125 ms 63900 KB Output is correct
20 Correct 123 ms 63800 KB Output is correct
21 Correct 125 ms 63848 KB Output is correct
22 Correct 130 ms 63860 KB Output is correct
23 Correct 137 ms 63820 KB Output is correct
24 Correct 128 ms 63860 KB Output is correct
25 Correct 139 ms 63944 KB Output is correct
26 Correct 138 ms 64068 KB Output is correct
27 Correct 140 ms 63976 KB Output is correct
28 Correct 108 ms 63688 KB Output is correct
29 Correct 104 ms 63752 KB Output is correct
30 Correct 109 ms 63772 KB Output is correct
31 Correct 107 ms 63776 KB Output is correct
32 Correct 109 ms 63716 KB Output is correct
33 Correct 118 ms 63772 KB Output is correct
34 Correct 142 ms 64604 KB Output is correct
35 Correct 132 ms 64236 KB Output is correct
36 Correct 116 ms 64112 KB Output is correct
37 Correct 165 ms 64892 KB Output is correct
38 Correct 164 ms 64796 KB Output is correct
39 Correct 163 ms 64868 KB Output is correct
40 Correct 166 ms 64836 KB Output is correct
41 Correct 159 ms 64728 KB Output is correct
42 Correct 110 ms 63776 KB Output is correct
43 Correct 160 ms 64952 KB Output is correct
44 Correct 155 ms 64788 KB Output is correct
45 Correct 157 ms 64796 KB Output is correct
46 Correct 161 ms 64916 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28568 KB Output is correct
2 Correct 13 ms 28564 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28456 KB Output is correct
5 Correct 13 ms 28500 KB Output is correct
6 Correct 16 ms 28504 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 14 ms 28464 KB Output is correct
9 Correct 15 ms 28504 KB Output is correct
10 Correct 15 ms 28516 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 14 ms 28496 KB Output is correct
13 Correct 14 ms 28508 KB Output is correct
14 Correct 14 ms 28500 KB Output is correct
15 Correct 13 ms 28556 KB Output is correct
16 Correct 14 ms 28496 KB Output is correct
17 Correct 13 ms 28500 KB Output is correct
18 Correct 14 ms 28512 KB Output is correct
19 Correct 14 ms 28520 KB Output is correct
20 Correct 17 ms 28492 KB Output is correct
21 Correct 14 ms 28512 KB Output is correct
22 Correct 13 ms 28512 KB Output is correct
23 Correct 15 ms 28488 KB Output is correct
24 Correct 13 ms 28500 KB Output is correct
25 Correct 14 ms 28500 KB Output is correct
26 Correct 14 ms 28516 KB Output is correct
27 Correct 14 ms 28504 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28568 KB Output is correct
2 Correct 13 ms 28564 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 14 ms 28456 KB Output is correct
5 Correct 13 ms 28500 KB Output is correct
6 Correct 16 ms 28504 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 14 ms 28464 KB Output is correct
9 Correct 15 ms 28504 KB Output is correct
10 Correct 15 ms 28516 KB Output is correct
11 Correct 14 ms 28500 KB Output is correct
12 Correct 14 ms 28496 KB Output is correct
13 Correct 14 ms 28508 KB Output is correct
14 Correct 14 ms 28500 KB Output is correct
15 Correct 13 ms 28556 KB Output is correct
16 Correct 14 ms 28496 KB Output is correct
17 Correct 13 ms 28500 KB Output is correct
18 Correct 14 ms 28512 KB Output is correct
19 Correct 14 ms 28520 KB Output is correct
20 Correct 17 ms 28492 KB Output is correct
21 Correct 14 ms 28512 KB Output is correct
22 Correct 13 ms 28512 KB Output is correct
23 Correct 15 ms 28488 KB Output is correct
24 Correct 13 ms 28500 KB Output is correct
25 Correct 14 ms 28500 KB Output is correct
26 Correct 14 ms 28516 KB Output is correct
27 Correct 14 ms 28504 KB Output is correct
28 Correct 17 ms 29652 KB Output is correct
29 Correct 17 ms 29652 KB Output is correct
30 Correct 17 ms 29676 KB Output is correct
31 Correct 18 ms 29668 KB Output is correct
32 Correct 17 ms 29692 KB Output is correct
33 Correct 16 ms 29660 KB Output is correct
34 Correct 16 ms 29672 KB Output is correct
35 Correct 21 ms 29680 KB Output is correct
36 Correct 20 ms 29652 KB Output is correct
37 Correct 20 ms 29676 KB Output is correct
38 Correct 17 ms 29620 KB Output is correct
39 Correct 22 ms 29756 KB Output is correct
40 Correct 23 ms 29656 KB Output is correct
41 Correct 20 ms 29672 KB Output is correct
42 Correct 19 ms 29692 KB Output is correct
43 Correct 20 ms 29680 KB Output is correct
44 Correct 19 ms 29652 KB Output is correct
45 Correct 19 ms 29712 KB Output is correct
46 Correct 16 ms 29668 KB Output is correct
47 Correct 19 ms 29604 KB Output is correct
48 Correct 20 ms 29652 KB Output is correct
49 Correct 18 ms 29652 KB Output is correct
50 Correct 18 ms 29680 KB Output is correct
51 Correct 18 ms 29676 KB Output is correct
52 Correct 19 ms 29676 KB Output is correct
53 Correct 17 ms 29604 KB Output is correct
54 Correct 17 ms 29624 KB Output is correct
55 Correct 17 ms 29668 KB Output is correct
56 Correct 17 ms 29688 KB Output is correct
57 Correct 19 ms 29700 KB Output is correct
58 Correct 18 ms 29652 KB Output is correct
59 Correct 17 ms 29692 KB Output is correct
60 Correct 17 ms 29652 KB Output is correct
61 Correct 18 ms 29752 KB Output is correct
62 Correct 17 ms 29672 KB Output is correct
63 Correct 18 ms 29636 KB Output is correct
64 Correct 16 ms 29684 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 28500 KB Output is correct
2 Correct 13 ms 28460 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 209 ms 65836 KB Output is correct
5 Correct 192 ms 65732 KB Output is correct
6 Correct 189 ms 65620 KB Output is correct
7 Correct 181 ms 65432 KB Output is correct
8 Correct 198 ms 65928 KB Output is correct
9 Correct 193 ms 65820 KB Output is correct
10 Correct 185 ms 65612 KB Output is correct
11 Correct 175 ms 65420 KB Output is correct
12 Correct 163 ms 65008 KB Output is correct
13 Correct 164 ms 65044 KB Output is correct
14 Correct 162 ms 64944 KB Output is correct
15 Correct 153 ms 64896 KB Output is correct
16 Correct 130 ms 64076 KB Output is correct
17 Correct 132 ms 64104 KB Output is correct
18 Correct 128 ms 64080 KB Output is correct
19 Correct 125 ms 63900 KB Output is correct
20 Correct 123 ms 63800 KB Output is correct
21 Correct 125 ms 63848 KB Output is correct
22 Correct 130 ms 63860 KB Output is correct
23 Correct 137 ms 63820 KB Output is correct
24 Correct 128 ms 63860 KB Output is correct
25 Correct 139 ms 63944 KB Output is correct
26 Correct 138 ms 64068 KB Output is correct
27 Correct 140 ms 63976 KB Output is correct
28 Correct 108 ms 63688 KB Output is correct
29 Correct 104 ms 63752 KB Output is correct
30 Correct 109 ms 63772 KB Output is correct
31 Correct 107 ms 63776 KB Output is correct
32 Correct 109 ms 63716 KB Output is correct
33 Correct 118 ms 63772 KB Output is correct
34 Correct 142 ms 64604 KB Output is correct
35 Correct 132 ms 64236 KB Output is correct
36 Correct 116 ms 64112 KB Output is correct
37 Correct 165 ms 64892 KB Output is correct
38 Correct 164 ms 64796 KB Output is correct
39 Correct 163 ms 64868 KB Output is correct
40 Correct 166 ms 64836 KB Output is correct
41 Correct 159 ms 64728 KB Output is correct
42 Correct 110 ms 63776 KB Output is correct
43 Correct 160 ms 64952 KB Output is correct
44 Correct 155 ms 64788 KB Output is correct
45 Correct 157 ms 64796 KB Output is correct
46 Correct 161 ms 64916 KB Output is correct
47 Correct 15 ms 28568 KB Output is correct
48 Correct 13 ms 28564 KB Output is correct
49 Correct 14 ms 28500 KB Output is correct
50 Correct 14 ms 28456 KB Output is correct
51 Correct 13 ms 28500 KB Output is correct
52 Correct 16 ms 28504 KB Output is correct
53 Correct 14 ms 28500 KB Output is correct
54 Correct 14 ms 28464 KB Output is correct
55 Correct 15 ms 28504 KB Output is correct
56 Correct 15 ms 28516 KB Output is correct
57 Correct 14 ms 28500 KB Output is correct
58 Correct 14 ms 28496 KB Output is correct
59 Correct 14 ms 28508 KB Output is correct
60 Correct 14 ms 28500 KB Output is correct
61 Correct 13 ms 28556 KB Output is correct
62 Correct 14 ms 28496 KB Output is correct
63 Correct 13 ms 28500 KB Output is correct
64 Correct 14 ms 28512 KB Output is correct
65 Correct 14 ms 28520 KB Output is correct
66 Correct 17 ms 28492 KB Output is correct
67 Correct 14 ms 28512 KB Output is correct
68 Correct 13 ms 28512 KB Output is correct
69 Correct 15 ms 28488 KB Output is correct
70 Correct 13 ms 28500 KB Output is correct
71 Correct 14 ms 28500 KB Output is correct
72 Correct 14 ms 28516 KB Output is correct
73 Correct 14 ms 28504 KB Output is correct
74 Correct 17 ms 29652 KB Output is correct
75 Correct 17 ms 29652 KB Output is correct
76 Correct 17 ms 29676 KB Output is correct
77 Correct 18 ms 29668 KB Output is correct
78 Correct 17 ms 29692 KB Output is correct
79 Correct 16 ms 29660 KB Output is correct
80 Correct 16 ms 29672 KB Output is correct
81 Correct 21 ms 29680 KB Output is correct
82 Correct 20 ms 29652 KB Output is correct
83 Correct 20 ms 29676 KB Output is correct
84 Correct 17 ms 29620 KB Output is correct
85 Correct 22 ms 29756 KB Output is correct
86 Correct 23 ms 29656 KB Output is correct
87 Correct 20 ms 29672 KB Output is correct
88 Correct 19 ms 29692 KB Output is correct
89 Correct 20 ms 29680 KB Output is correct
90 Correct 19 ms 29652 KB Output is correct
91 Correct 19 ms 29712 KB Output is correct
92 Correct 16 ms 29668 KB Output is correct
93 Correct 19 ms 29604 KB Output is correct
94 Correct 20 ms 29652 KB Output is correct
95 Correct 18 ms 29652 KB Output is correct
96 Correct 18 ms 29680 KB Output is correct
97 Correct 18 ms 29676 KB Output is correct
98 Correct 19 ms 29676 KB Output is correct
99 Correct 17 ms 29604 KB Output is correct
100 Correct 17 ms 29624 KB Output is correct
101 Correct 17 ms 29668 KB Output is correct
102 Correct 17 ms 29688 KB Output is correct
103 Correct 19 ms 29700 KB Output is correct
104 Correct 18 ms 29652 KB Output is correct
105 Correct 17 ms 29692 KB Output is correct
106 Correct 17 ms 29652 KB Output is correct
107 Correct 18 ms 29752 KB Output is correct
108 Correct 17 ms 29672 KB Output is correct
109 Correct 18 ms 29636 KB Output is correct
110 Correct 16 ms 29684 KB Output is correct
111 Correct 285 ms 66356 KB Output is correct
112 Correct 266 ms 66424 KB Output is correct
113 Correct 268 ms 66464 KB Output is correct
114 Correct 246 ms 66864 KB Output is correct
115 Correct 260 ms 66376 KB Output is correct
116 Correct 185 ms 65604 KB Output is correct
117 Correct 182 ms 65732 KB Output is correct
118 Correct 531 ms 67932 KB Output is correct
119 Correct 584 ms 67996 KB Output is correct
120 Correct 507 ms 67172 KB Output is correct
121 Correct 154 ms 65612 KB Output is correct
122 Correct 478 ms 67152 KB Output is correct
123 Correct 455 ms 67272 KB Output is correct
124 Correct 444 ms 66948 KB Output is correct
125 Correct 155 ms 65696 KB Output is correct
126 Correct 411 ms 66344 KB Output is correct
127 Correct 404 ms 66444 KB Output is correct
128 Correct 385 ms 66308 KB Output is correct
129 Correct 167 ms 65632 KB Output is correct
130 Correct 393 ms 66376 KB Output is correct
131 Correct 370 ms 66156 KB Output is correct
132 Correct 364 ms 66420 KB Output is correct
133 Correct 167 ms 65620 KB Output is correct
134 Correct 337 ms 66200 KB Output is correct
135 Correct 295 ms 66388 KB Output is correct
136 Correct 297 ms 66264 KB Output is correct
137 Correct 167 ms 65948 KB Output is correct
138 Correct 244 ms 66092 KB Output is correct
139 Correct 260 ms 66124 KB Output is correct
140 Correct 248 ms 66152 KB Output is correct
141 Correct 168 ms 65720 KB Output is correct
142 Correct 199 ms 67960 KB Output is correct
143 Correct 199 ms 67944 KB Output is correct
144 Correct 197 ms 67956 KB Output is correct
145 Correct 207 ms 67960 KB Output is correct
146 Correct 186 ms 67836 KB Output is correct
147 Correct 180 ms 67788 KB Output is correct
148 Correct 194 ms 67740 KB Output is correct
149 Correct 190 ms 67832 KB Output is correct
150 Correct 186 ms 67668 KB Output is correct
151 Correct 176 ms 67420 KB Output is correct
152 Correct 108 ms 65748 KB Output is correct
153 Correct 196 ms 67916 KB Output is correct
154 Correct 207 ms 67928 KB Output is correct
155 Correct 201 ms 67928 KB Output is correct
156 Correct 186 ms 67824 KB Output is correct
157 Correct 192 ms 67712 KB Output is correct
158 Correct 195 ms 67684 KB Output is correct
159 Correct 183 ms 67604 KB Output is correct
160 Correct 111 ms 65648 KB Output is correct
161 Correct 448 ms 67304 KB Output is correct
162 Correct 430 ms 67132 KB Output is correct
163 Correct 427 ms 67024 KB Output is correct
164 Correct 430 ms 66892 KB Output is correct
165 Correct 457 ms 67024 KB Output is correct
166 Correct 107 ms 65640 KB Output is correct
167 Correct 156 ms 66856 KB Output is correct
168 Correct 153 ms 66748 KB Output is correct
169 Correct 151 ms 66960 KB Output is correct
170 Correct 152 ms 66788 KB Output is correct
171 Correct 162 ms 66252 KB Output is correct
172 Correct 151 ms 66828 KB Output is correct
173 Correct 480 ms 67364 KB Output is correct
174 Correct 521 ms 67428 KB Output is correct
175 Correct 468 ms 67000 KB Output is correct
176 Correct 458 ms 66956 KB Output is correct