oj.uz

Submission #417267

# Submission time Handle Problem Language Result Execution time Memory
417267 2021-06-03T14:07:28 Z pavement Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 134384 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<iii, null_type, greater<iii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, K, curr, L[500005], R[500005], dep[500005], anc[500005][25];
bool vis[500005];
ii mx[500005], prec[500005];
multiset<ii> untaken;
vector<int> v, adj[500005];
vector<ii> vec[500005];

void dfs(int n, int e = -1) {
	anc[n][0] = e;
	vis[n] = 1;
	for (int i = 1; i <= 20; i++)
		if (anc[n][i - 1] != -1) anc[n][i] = anc[anc[n][i - 1]][i - 1];
	for (auto u : adj[n]) if (u != e) {
		dep[u] = dep[n] + 1;
		dfs(u, n);
	}
}

int get(int l, int r) {
	auto tmp = prec[l];
	if (tmp.second == LLONG_MAX) return 0;
	int curr = tmp.second;
	if (R[curr] > r) return 0;
	for (int i = 20; i >= 0; i--)
		if (anc[curr][i] != -1 && R[anc[curr][i]] <= r) curr = anc[curr][i];
	return dep[mx[l].second] - dep[curr] + 1;
}

int forceadd(int x, bool b = 0) {
	// add [L[x], R[x]]
	auto it = untaken.lower_bound(mp(R[x], 0ll));
	if (it == untaken.begin()) return -1;
	--it;
	if (it->first <= L[x] && R[x] <= it->second) {
		if (b == 1) {
			untaken.emplace(it->first, L[x]);
			untaken.emplace(R[x], it->second);
			untaken.erase(it);
		}
		int tmp = 1 + curr + -get(it->first, it->second) + get(it->first, L[x]) + get(R[x], it->second);
		if (b) curr = tmp;
		return tmp;
	} else return -1;
}

main() {
	memset(anc, -1, sizeof anc);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> K;
	for (int i = 1; i <= N; i++) cin >> L[i] >> R[i], v.pb(L[i]), v.pb(R[i]);
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (int i = 1; i <= N; i++) {
		L[i] = lower_bound(v.begin(), v.end(), L[i]) - v.begin() + 1;
		R[i] = lower_bound(v.begin(), v.end(), R[i]) - v.begin() + 1;
		vec[L[i]].eb(R[i], i);
	}
	for (int i = 2 * N; i >= 1; i--) {
		prec[i] = mp(LLONG_MAX, LLONG_MAX);
		if (i < 2 * N) prec[i] = prec[i + 1];
		for (auto j : vec[i]) prec[i] = min(prec[i], j);
	}
	for (int i = 1; i <= N; i++) {
		auto tmp = prec[R[i]];
		if (tmp.second != LLONG_MAX) adj[tmp.second].pb(i);
	}
	for (int i = 1; i <= N; i++)
		if (!vis[i]) dfs(i);
	for (int i = 1; i <= 2 * N; i++)
		mx[L[i]] = max(mx[L[i]], mp(dep[i] + 1, i));
	for (int i = 2 * N; i >= 1; i--) mx[i] = max(mx[i], mx[i + 1]);
	untaken.emplace(1, 2 * N);
	curr = get(1, 2 * N);
	if (get(1, 2 * N) < K) return cout << "-1\n", 0;
	for (int i = 1, cnt = 0; i <= N; i++) {
		int x = forceadd(i);
		if (x >= K) {
			cout << i << '\n';
			cnt++;
			if (cnt == K) return 0;
			forceadd(i, 1);
		}
	}
}

Compilation message

event2.cpp:73:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   73 | main() {
      | ^~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 121668 KB Output is correct
2 Correct 54 ms 121548 KB Output is correct
3 Correct 54 ms 121556 KB Output is correct
4 Execution timed out 3101 ms 134384 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 121588 KB Output is correct
2 Correct 54 ms 121580 KB Output is correct
3 Correct 58 ms 121596 KB Output is correct
4 Correct 62 ms 121564 KB Output is correct
5 Correct 60 ms 121612 KB Output is correct
6 Correct 55 ms 121612 KB Output is correct
7 Correct 56 ms 121600 KB Output is correct
8 Correct 56 ms 121668 KB Output is correct
9 Correct 61 ms 121672 KB Output is correct
10 Correct 58 ms 121656 KB Output is correct
11 Correct 55 ms 121664 KB Output is correct
12 Correct 57 ms 121640 KB Output is correct
13 Correct 54 ms 121580 KB Output is correct
14 Correct 58 ms 121652 KB Output is correct
15 Correct 54 ms 121596 KB Output is correct
16 Correct 53 ms 121612 KB Output is correct
17 Correct 56 ms 121680 KB Output is correct
18 Correct 54 ms 121564 KB Output is correct
19 Correct 53 ms 121648 KB Output is correct
20 Correct 54 ms 121620 KB Output is correct
21 Correct 53 ms 121604 KB Output is correct
22 Correct 54 ms 121676 KB Output is correct
23 Correct 53 ms 121624 KB Output is correct
24 Correct 53 ms 121668 KB Output is correct
25 Correct 57 ms 121676 KB Output is correct
26 Correct 54 ms 121648 KB Output is correct
27 Correct 62 ms 121664 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 121588 KB Output is correct
2 Correct 54 ms 121580 KB Output is correct
3 Correct 58 ms 121596 KB Output is correct
4 Correct 62 ms 121564 KB Output is correct
5 Correct 60 ms 121612 KB Output is correct
6 Correct 55 ms 121612 KB Output is correct
7 Correct 56 ms 121600 KB Output is correct
8 Correct 56 ms 121668 KB Output is correct
9 Correct 61 ms 121672 KB Output is correct
10 Correct 58 ms 121656 KB Output is correct
11 Correct 55 ms 121664 KB Output is correct
12 Correct 57 ms 121640 KB Output is correct
13 Correct 54 ms 121580 KB Output is correct
14 Correct 58 ms 121652 KB Output is correct
15 Correct 54 ms 121596 KB Output is correct
16 Correct 53 ms 121612 KB Output is correct
17 Correct 56 ms 121680 KB Output is correct
18 Correct 54 ms 121564 KB Output is correct
19 Correct 53 ms 121648 KB Output is correct
20 Correct 54 ms 121620 KB Output is correct
21 Correct 53 ms 121604 KB Output is correct
22 Correct 54 ms 121676 KB Output is correct
23 Correct 53 ms 121624 KB Output is correct
24 Correct 53 ms 121668 KB Output is correct
25 Correct 57 ms 121676 KB Output is correct
26 Correct 54 ms 121648 KB Output is correct
27 Correct 62 ms 121664 KB Output is correct
28 Correct 58 ms 122120 KB Output is correct
29 Correct 58 ms 122056 KB Output is correct
30 Correct 62 ms 122080 KB Output is correct
31 Correct 60 ms 122088 KB Output is correct
32 Correct 59 ms 122096 KB Output is correct
33 Correct 58 ms 122120 KB Output is correct
34 Correct 60 ms 122004 KB Output is correct
35 Correct 65 ms 122408 KB Output is correct
36 Correct 69 ms 122384 KB Output is correct
37 Correct 61 ms 122352 KB Output is correct
38 Correct 68 ms 122320 KB Output is correct
39 Correct 63 ms 122396 KB Output is correct
40 Correct 66 ms 122340 KB Output is correct
41 Correct 64 ms 122348 KB Output is correct
42 Correct 61 ms 122260 KB Output is correct
43 Correct 70 ms 122180 KB Output is correct
44 Correct 58 ms 122164 KB Output is correct
45 Correct 63 ms 122192 KB Output is correct
46 Correct 60 ms 122140 KB Output is correct
47 Correct 60 ms 122100 KB Output is correct
48 Correct 57 ms 122092 KB Output is correct
49 Correct 56 ms 122080 KB Output is correct
50 Correct 60 ms 122120 KB Output is correct
51 Correct 57 ms 122092 KB Output is correct
52 Correct 58 ms 122100 KB Output is correct
53 Correct 70 ms 122072 KB Output is correct
54 Correct 57 ms 122024 KB Output is correct
55 Correct 462 ms 122444 KB Output is correct
56 Correct 464 ms 122496 KB Output is correct
57 Correct 463 ms 122524 KB Output is correct
58 Correct 478 ms 122436 KB Output is correct
59 Correct 480 ms 122424 KB Output is correct
60 Correct 459 ms 122440 KB Output is correct
61 Correct 464 ms 122476 KB Output is correct
62 Correct 454 ms 122428 KB Output is correct
63 Correct 464 ms 122448 KB Output is correct
64 Correct 460 ms 122376 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 121668 KB Output is correct
2 Correct 54 ms 121548 KB Output is correct
3 Correct 54 ms 121556 KB Output is correct
4 Execution timed out 3101 ms 134384 KB Time limit exceeded
5 Halted 0 ms 0 KB -