oj.uz

Submission #537724

# Submission time Handle Problem Language Result Execution time Memory
537724 2022-03-15T12:33:34 Z GioChkhaidze Event Hopping 2 (JOI21_event2) C++14
100 / 100
 454 ms 38768 KB 
#include <bits/stdc++.h>

#define lf (h << 1)
#define mf ((l + r) >> 1)
#define rf ((h << 1) | 1)
#define tree int h, int l, int r
#define left lf, l, mf
#define right rf, mf + 1, r
#define pb push_back
#define f first
#define s second

using namespace std;

const int N = 1e5 + 5;

int n, k;
int l[N], r[N], ans[N], L[N][19], R[N][19];

int getl(int idx, int rpr) {
	int ret = 0;
	if (!idx) return ret;
	for (int j = 17; j >= 0; --j) {
		if (!L[idx][j]) continue;
		if (rpr <= l[L[idx][j]]) {
			ret += (1 << j);
			idx = L[idx][j];
		}
	}
	return ret;
}

int getr(int idx, int lnx) {
	int ret = 0;
	if (!idx) return ret;
	for (int j = 17; j >= 0; --j) {
		if (!R[idx][j]) continue;
		if (r[R[idx][j]] <= lnx) {
			ret += (1 << j);
			idx = R[idx][j];
		}
	}
	return ret;
}

vector < int > res;
set < pair < int , int > > stl, str;
set < pair < int , int > > :: iterator itl, itr;

int tot, resA, resB;
bool check_add(int id) {
	int res, resA, resB, rpr = 0, lnx = 1e9, idn = 0, idp = 0;
	if (!stl.size()) {
		res = getl(id, 0) + 1 + getr(id, 1e9);
		if (res >= k) {
			tot = res;
			return true;
		}
		return false;
	}

	itl = stl.lower_bound({r[id], 0});
	itr = str.lower_bound({l[id] + 1, 0});
		
	if (itl != stl.end()) lnx = (*itl).f, idn = (*itl).s;		
	if (itr != str.begin()) --itr, rpr = (*itr).f, idp = (*itr).s;
		
	itl = stl.lower_bound({l[id], 0});
	itr = str.lower_bound({l[id] + 1, 0});
	
	if (itl != stl.end() && l[(*itl).s] < r[id]) return false;
	if (itr != str.end() && (r[(*itr).s] <= r[id] || l[(*itr).s] <= l[id])) return false;
	
	res = getl(id, rpr) + 1 + getr(id, lnx);
	if (idp) {
		resA = getr(idp, lnx);
		if (tot - resA + res >= k) {
			tot -= resA - res;
			return true;
		}
		return false;
	}
	if (idn) {
		resB = getl(idn, rpr);
		if (tot - resB + res >= k) {
			tot -= resB - res;
			return true;
		}
		return false;
	}
	res += 1/0;
}

main () {
	ios::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
	cin >> n >> k;
	vector < pair < pair < int , int > , int > > s; 
	map < int , int > f;
	vector < int > g;
	for (int i = 1; i <= n; ++i) {
		cin >> l[i] >> r[i];
		g.pb(l[i]), g.pb(r[i]);	
	}
	
	sort(g.begin(), g.end());
	g.erase(unique(g.begin(), g.end()), g.end());
	for (int i = 0; i < g.size(); ++i) {
		f[g[i]] = i + 1;
	}
	
	int sz = g.size();
	for (int i = 1; i <= n; ++i) {
		l[i] = f[l[i]], r[i] = f[r[i]];
		s.pb({{l[i], 1}, i});
		s.pb({{r[i], 0}, i});
	}
	
	int rm = 1e9, idr = 0;
	sort(s.begin(), s.end());
	for (int i = s.size() - 1; i >= 0; --i) {
		int id = s[i].s, tp = s[i].f.s;
		if (tp && r[id] < rm) rm = r[id], idr = id;
		if (!tp) R[id][0] = idr;
	}
	
	int lm = 0, idl = 0;
	for (int i = 0; i < s.size(); ++i) {
		int id = s[i].s, tp = s[i].f.s;
		if (!tp && lm < l[id]) lm = l[id], idl = id;
		if (tp) L[id][0] = idl;
	}
	
	for (int j = 1; j <= 17; ++j)
		for (int i = 1; i <= n; ++i) {
			L[i][j] = L[L[i][j - 1]][j - 1];
			R[i][j] = R[R[i][j - 1]][j - 1];
		}

	for (int i = 1; i <= n; ++i) 
		if (check_add(i) && res.size() < k) {
			stl.insert({l[i], i});
			str.insert({r[i], i});
			res.pb(i);
		}
	
	if (res.size() < k) cout << -1 << "\n";
		else {
		for (int i = 0; i < k; ++i) 
			cout << res[i] << "\n";
	}
}

Compilation message

event2.cpp: In function 'bool check_add(int)':
event2.cpp:91:10: warning: division by zero [-Wdiv-by-zero]
   91 |  res += 1/0;
      |         ~^~
event2.cpp: At global scope:
event2.cpp:94:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   94 | main () {
      | ^~~~
event2.cpp: In function 'int main()':
event2.cpp:108:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |  for (int i = 0; i < g.size(); ++i) {
      |                  ~~^~~~~~~~~~
event2.cpp:128:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |  for (int i = 0; i < s.size(); ++i) {
      |                  ~~^~~~~~~~~~
event2.cpp:141:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  141 |   if (check_add(i) && res.size() < k) {
      |                       ~~~~~~~~~~~^~~
event2.cpp:147:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  147 |  if (res.size() < k) cout << -1 << "\n";
      |      ~~~~~~~~~~~^~~
event2.cpp:112:6: warning: unused variable 'sz' [-Wunused-variable]
  112 |  int sz = g.size();
      |      ^~
event2.cpp: In function 'bool check_add(int)':
event2.cpp:91:6: warning: control reaches end of non-void function [-Wreturn-type]
   91 |  res += 1/0;
      |  ~~~~^~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 213 ms 38100 KB Output is correct
5 Correct 217 ms 37584 KB Output is correct
6 Correct 225 ms 37172 KB Output is correct
7 Correct 219 ms 36184 KB Output is correct
8 Correct 223 ms 38112 KB Output is correct
9 Correct 235 ms 37596 KB Output is correct
10 Correct 229 ms 37092 KB Output is correct
11 Correct 246 ms 36184 KB Output is correct
12 Correct 210 ms 34364 KB Output is correct
13 Correct 190 ms 34116 KB Output is correct
14 Correct 203 ms 33824 KB Output is correct
15 Correct 193 ms 33240 KB Output is correct
16 Correct 180 ms 29752 KB Output is correct
17 Correct 154 ms 29600 KB Output is correct
18 Correct 160 ms 29496 KB Output is correct
19 Correct 137 ms 29268 KB Output is correct
20 Correct 128 ms 29272 KB Output is correct
21 Correct 128 ms 29240 KB Output is correct
22 Correct 135 ms 29180 KB Output is correct
23 Correct 152 ms 29244 KB Output is correct
24 Correct 140 ms 29196 KB Output is correct
25 Correct 139 ms 29248 KB Output is correct
26 Correct 141 ms 29244 KB Output is correct
27 Correct 154 ms 29336 KB Output is correct
28 Correct 148 ms 29244 KB Output is correct
29 Correct 130 ms 29184 KB Output is correct
30 Correct 146 ms 29196 KB Output is correct
31 Correct 139 ms 29244 KB Output is correct
32 Correct 152 ms 29244 KB Output is correct
33 Correct 139 ms 29316 KB Output is correct
34 Correct 196 ms 31980 KB Output is correct
35 Correct 199 ms 30892 KB Output is correct
36 Correct 183 ms 29632 KB Output is correct
37 Correct 186 ms 33620 KB Output is correct
38 Correct 218 ms 33504 KB Output is correct
39 Correct 209 ms 33268 KB Output is correct
40 Correct 182 ms 33004 KB Output is correct
41 Correct 182 ms 32860 KB Output is correct
42 Correct 153 ms 29252 KB Output is correct
43 Correct 245 ms 33372 KB Output is correct
44 Correct 210 ms 33200 KB Output is correct
45 Correct 197 ms 33008 KB Output is correct
46 Correct 215 ms 32876 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 4 ms 1236 KB Output is correct
29 Correct 4 ms 1304 KB Output is correct
30 Correct 4 ms 1236 KB Output is correct
31 Correct 5 ms 1236 KB Output is correct
32 Correct 4 ms 1364 KB Output is correct
33 Correct 5 ms 1364 KB Output is correct
34 Correct 5 ms 1236 KB Output is correct
35 Correct 6 ms 1556 KB Output is correct
36 Correct 6 ms 1492 KB Output is correct
37 Correct 6 ms 1364 KB Output is correct
38 Correct 4 ms 1236 KB Output is correct
39 Correct 6 ms 1620 KB Output is correct
40 Correct 6 ms 1492 KB Output is correct
41 Correct 6 ms 1360 KB Output is correct
42 Correct 5 ms 1300 KB Output is correct
43 Correct 7 ms 1364 KB Output is correct
44 Correct 5 ms 1364 KB Output is correct
45 Correct 6 ms 1364 KB Output is correct
46 Correct 4 ms 1236 KB Output is correct
47 Correct 4 ms 1240 KB Output is correct
48 Correct 4 ms 1236 KB Output is correct
49 Correct 4 ms 1336 KB Output is correct
50 Correct 5 ms 1236 KB Output is correct
51 Correct 4 ms 1236 KB Output is correct
52 Correct 4 ms 1236 KB Output is correct
53 Correct 4 ms 1328 KB Output is correct
54 Correct 4 ms 1244 KB Output is correct
55 Correct 4 ms 1364 KB Output is correct
56 Correct 4 ms 1364 KB Output is correct
57 Correct 4 ms 1364 KB Output is correct
58 Correct 5 ms 1424 KB Output is correct
59 Correct 4 ms 1364 KB Output is correct
60 Correct 5 ms 1364 KB Output is correct
61 Correct 4 ms 1364 KB Output is correct
62 Correct 4 ms 1364 KB Output is correct
63 Correct 5 ms 1360 KB Output is correct
64 Correct 3 ms 1108 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 213 ms 38100 KB Output is correct
5 Correct 217 ms 37584 KB Output is correct
6 Correct 225 ms 37172 KB Output is correct
7 Correct 219 ms 36184 KB Output is correct
8 Correct 223 ms 38112 KB Output is correct
9 Correct 235 ms 37596 KB Output is correct
10 Correct 229 ms 37092 KB Output is correct
11 Correct 246 ms 36184 KB Output is correct
12 Correct 210 ms 34364 KB Output is correct
13 Correct 190 ms 34116 KB Output is correct
14 Correct 203 ms 33824 KB Output is correct
15 Correct 193 ms 33240 KB Output is correct
16 Correct 180 ms 29752 KB Output is correct
17 Correct 154 ms 29600 KB Output is correct
18 Correct 160 ms 29496 KB Output is correct
19 Correct 137 ms 29268 KB Output is correct
20 Correct 128 ms 29272 KB Output is correct
21 Correct 128 ms 29240 KB Output is correct
22 Correct 135 ms 29180 KB Output is correct
23 Correct 152 ms 29244 KB Output is correct
24 Correct 140 ms 29196 KB Output is correct
25 Correct 139 ms 29248 KB Output is correct
26 Correct 141 ms 29244 KB Output is correct
27 Correct 154 ms 29336 KB Output is correct
28 Correct 148 ms 29244 KB Output is correct
29 Correct 130 ms 29184 KB Output is correct
30 Correct 146 ms 29196 KB Output is correct
31 Correct 139 ms 29244 KB Output is correct
32 Correct 152 ms 29244 KB Output is correct
33 Correct 139 ms 29316 KB Output is correct
34 Correct 196 ms 31980 KB Output is correct
35 Correct 199 ms 30892 KB Output is correct
36 Correct 183 ms 29632 KB Output is correct
37 Correct 186 ms 33620 KB Output is correct
38 Correct 218 ms 33504 KB Output is correct
39 Correct 209 ms 33268 KB Output is correct
40 Correct 182 ms 33004 KB Output is correct
41 Correct 182 ms 32860 KB Output is correct
42 Correct 153 ms 29252 KB Output is correct
43 Correct 245 ms 33372 KB Output is correct
44 Correct 210 ms 33200 KB Output is correct
45 Correct 197 ms 33008 KB Output is correct
46 Correct 215 ms 32876 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 324 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 328 KB Output is correct
67 Correct 1 ms 328 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 4 ms 1236 KB Output is correct
75 Correct 4 ms 1304 KB Output is correct
76 Correct 4 ms 1236 KB Output is correct
77 Correct 5 ms 1236 KB Output is correct
78 Correct 4 ms 1364 KB Output is correct
79 Correct 5 ms 1364 KB Output is correct
80 Correct 5 ms 1236 KB Output is correct
81 Correct 6 ms 1556 KB Output is correct
82 Correct 6 ms 1492 KB Output is correct
83 Correct 6 ms 1364 KB Output is correct
84 Correct 4 ms 1236 KB Output is correct
85 Correct 6 ms 1620 KB Output is correct
86 Correct 6 ms 1492 KB Output is correct
87 Correct 6 ms 1360 KB Output is correct
88 Correct 5 ms 1300 KB Output is correct
89 Correct 7 ms 1364 KB Output is correct
90 Correct 5 ms 1364 KB Output is correct
91 Correct 6 ms 1364 KB Output is correct
92 Correct 4 ms 1236 KB Output is correct
93 Correct 4 ms 1240 KB Output is correct
94 Correct 4 ms 1236 KB Output is correct
95 Correct 4 ms 1336 KB Output is correct
96 Correct 5 ms 1236 KB Output is correct
97 Correct 4 ms 1236 KB Output is correct
98 Correct 4 ms 1236 KB Output is correct
99 Correct 4 ms 1328 KB Output is correct
100 Correct 4 ms 1244 KB Output is correct
101 Correct 4 ms 1364 KB Output is correct
102 Correct 4 ms 1364 KB Output is correct
103 Correct 4 ms 1364 KB Output is correct
104 Correct 5 ms 1424 KB Output is correct
105 Correct 4 ms 1364 KB Output is correct
106 Correct 5 ms 1364 KB Output is correct
107 Correct 4 ms 1364 KB Output is correct
108 Correct 4 ms 1364 KB Output is correct
109 Correct 5 ms 1360 KB Output is correct
110 Correct 3 ms 1108 KB Output is correct
111 Correct 231 ms 29820 KB Output is correct
112 Correct 245 ms 29852 KB Output is correct
113 Correct 275 ms 29896 KB Output is correct
114 Correct 228 ms 29828 KB Output is correct
115 Correct 231 ms 29756 KB Output is correct
116 Correct 259 ms 29736 KB Output is correct
117 Correct 209 ms 29796 KB Output is correct
118 Correct 454 ms 38768 KB Output is correct
119 Correct 350 ms 37720 KB Output is correct
120 Correct 306 ms 33888 KB Output is correct
121 Correct 283 ms 29868 KB Output is correct
122 Correct 302 ms 34964 KB Output is correct
123 Correct 327 ms 34468 KB Output is correct
124 Correct 358 ms 33896 KB Output is correct
125 Correct 247 ms 29756 KB Output is correct
126 Correct 305 ms 30356 KB Output is correct
127 Correct 249 ms 30272 KB Output is correct
128 Correct 290 ms 30112 KB Output is correct
129 Correct 236 ms 29756 KB Output is correct
130 Correct 235 ms 29876 KB Output is correct
131 Correct 285 ms 29848 KB Output is correct
132 Correct 243 ms 29836 KB Output is correct
133 Correct 247 ms 29952 KB Output is correct
134 Correct 273 ms 29844 KB Output is correct
135 Correct 261 ms 29804 KB Output is correct
136 Correct 234 ms 29744 KB Output is correct
137 Correct 237 ms 29836 KB Output is correct
138 Correct 226 ms 29816 KB Output is correct
139 Correct 222 ms 29724 KB Output is correct
140 Correct 244 ms 29832 KB Output is correct
141 Correct 208 ms 29812 KB Output is correct
142 Correct 206 ms 34768 KB Output is correct
143 Correct 247 ms 34668 KB Output is correct
144 Correct 198 ms 34756 KB Output is correct
145 Correct 200 ms 34620 KB Output is correct
146 Correct 209 ms 34456 KB Output is correct
147 Correct 189 ms 34232 KB Output is correct
148 Correct 192 ms 33976 KB Output is correct
149 Correct 204 ms 33848 KB Output is correct
150 Correct 207 ms 33596 KB Output is correct
151 Correct 187 ms 32572 KB Output is correct
152 Correct 105 ms 25144 KB Output is correct
153 Correct 218 ms 34640 KB Output is correct
154 Correct 217 ms 34488 KB Output is correct
155 Correct 196 ms 34224 KB Output is correct
156 Correct 197 ms 34012 KB Output is correct
157 Correct 216 ms 33896 KB Output is correct
158 Correct 209 ms 33696 KB Output is correct
159 Correct 194 ms 32592 KB Output is correct
160 Correct 105 ms 25184 KB Output is correct
161 Correct 373 ms 31816 KB Output is correct
162 Correct 272 ms 31676 KB Output is correct
163 Correct 262 ms 31424 KB Output is correct
164 Correct 312 ms 31212 KB Output is correct
165 Correct 325 ms 31128 KB Output is correct
166 Correct 144 ms 29812 KB Output is correct
167 Correct 202 ms 34020 KB Output is correct
168 Correct 199 ms 33820 KB Output is correct
169 Correct 205 ms 33572 KB Output is correct
170 Correct 193 ms 33368 KB Output is correct
171 Correct 180 ms 34224 KB Output is correct
172 Correct 209 ms 34300 KB Output is correct
173 Correct 290 ms 29484 KB Output is correct
174 Correct 267 ms 29536 KB Output is correct
175 Correct 313 ms 29452 KB Output is correct
176 Correct 270 ms 28420 KB Output is correct