oj.uz

Submission #395430

# Submission time Handle Problem Language Result Execution time Memory
395430 2021-04-28T10:45:51 Z wenqi Joker (BOI20_joker) C++14
49 / 100
 2000 ms 17344 KB 
#include <bits/stdc++.h>

using namespace std;

int N, M, Q;

int parents[600069];
int sz[600069];

int ans[600069];

#define ROOT 60

struct E {
	int i, a;
	int j, b;
};

struct R {
	int i, l, r, bl;
};

vector<E> moves;

void reset() {
	for (int i = 0; i < 2 * N; i++) {
		parents[i] = i;
		sz[i] = 1;
	}
	moves.clear();
}

int getp(int i) {
	return i == parents[i] ? i : getp(parents[i]);
}

bool join(int a, int b) {
	a = getp(a);
	b = getp(b);

	if(a == b) {
		moves.push_back({-1});
		return false;
	}

	if(sz[a] > sz[b]) {
		moves.push_back({b, parents[b], a, sz[a]});
		parents[b] = a;
		sz[a] += sz[b];
	}else{
		moves.push_back({a, parents[a], b, sz[b]});
		parents[a] = b;
		sz[b] += sz[a];
	}

	return getp(a) == getp((a + N) % (2 * N)) or getp(b) == getp((b + N) % (2 * N));
}

void reload() {
	auto p = moves.back();
	moves.pop_back();

	if(p.i == -1)
		return;

	parents[p.i] = p.a;
	sz[p.j] = p.b;
}

int A[200069];
int B[200069];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M >> Q;
	for (int i = 1; i <= M; i++) {
		int a, b;
		cin >> a >> b;
		A[i] = --a;
		B[i] = --b;
	}
	vector<R> queries;
	for (int i = 0; i < Q; i++) {
		int l, r;
		cin >> l >> r;
		queries.push_back({i, l, r, l / ROOT});
	}
	sort(queries.begin(), queries.end(), [](R& a, R& b) {
		return a.bl < b.bl or (a.bl == b.bl and a.r > b.r);
	});
	bool made = false;
	int pbl = -1;
	int nxt = 0;
	int up = 0;
	int start = 1;
	bool doable = false;
	reset();
	for (const R& a : queries) {
		int Bs = a.bl * ROOT;

		if(a.bl != pbl) {
			doable = false;

			for(int i = 0; i < up; i++) {
				reload();
			}
			up = 0;

			for (; start < Bs; start++) {
				made |= join(A[start], B[start] + N);
				made |= join(A[start] + N, B[start]);
			}

			nxt = M;
			pbl = a.bl;
		}

		for(; nxt > a.r; nxt--) {
			doable |= join(A[nxt], B[nxt] + N);
			doable |= join(A[nxt] + N, B[nxt]);
			up += 2;
		}

		bool k = false;

		int cnt = 0;

		for (int i = Bs; i < a.l; i++) {
			if(i == 0) continue;
			k |= join(A[i], B[i] + N);
			k |= join(A[i] + N, B[i]);
			cnt += 2;
		}

		ans[a.i] = made or k or doable;

		for (int i = 0; i < cnt; i++) {
			reload();
		}
	}
	for(int i = 0; i < Q; i++) {
		cout << (ans[i] ? "YES" : "NO") << '\n';
	}
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 5 ms 492 KB Output is correct
30 Correct 7 ms 460 KB Output is correct
31 Correct 7 ms 460 KB Output is correct
32 Correct 8 ms 460 KB Output is correct
33 Correct 6 ms 460 KB Output is correct
34 Correct 7 ms 460 KB Output is correct
35 Correct 7 ms 460 KB Output is correct
36 Correct 5 ms 460 KB Output is correct
37 Correct 6 ms 464 KB Output is correct
38 Correct 7 ms 460 KB Output is correct
39 Correct 7 ms 460 KB Output is correct
40 Correct 7 ms 460 KB Output is correct
41 Correct 6 ms 540 KB Output is correct
42 Correct 6 ms 460 KB Output is correct
43 Correct 7 ms 468 KB Output is correct
44 Correct 8 ms 460 KB Output is correct
45 Correct 7 ms 460 KB Output is correct
46 Correct 7 ms 460 KB Output is correct
47 Correct 6 ms 460 KB Output is correct
48 Correct 8 ms 544 KB Output is correct
49 Correct 7 ms 548 KB Output is correct
50 Correct 8 ms 460 KB Output is correct
51 Correct 6 ms 460 KB Output is correct
52 Correct 7 ms 460 KB Output is correct
53 Correct 7 ms 460 KB Output is correct
54 Correct 7 ms 460 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 124 ms 15688 KB Output is correct
4 Correct 132 ms 17256 KB Output is correct
5 Correct 139 ms 16968 KB Output is correct
6 Correct 123 ms 15716 KB Output is correct
7 Correct 127 ms 15608 KB Output is correct
8 Correct 126 ms 14996 KB Output is correct
9 Correct 120 ms 15684 KB Output is correct
10 Correct 133 ms 17276 KB Output is correct
11 Correct 121 ms 15804 KB Output is correct
12 Correct 129 ms 16960 KB Output is correct
13 Correct 121 ms 14572 KB Output is correct
14 Correct 126 ms 15096 KB Output is correct
15 Correct 137 ms 16280 KB Output is correct
16 Correct 139 ms 17344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 124 ms 15688 KB Output is correct
30 Correct 132 ms 17256 KB Output is correct
31 Correct 139 ms 16968 KB Output is correct
32 Correct 123 ms 15716 KB Output is correct
33 Correct 127 ms 15608 KB Output is correct
34 Correct 126 ms 14996 KB Output is correct
35 Correct 120 ms 15684 KB Output is correct
36 Correct 133 ms 17276 KB Output is correct
37 Correct 121 ms 15804 KB Output is correct
38 Correct 129 ms 16960 KB Output is correct
39 Correct 121 ms 14572 KB Output is correct
40 Correct 126 ms 15096 KB Output is correct
41 Correct 137 ms 16280 KB Output is correct
42 Correct 139 ms 17344 KB Output is correct
43 Correct 438 ms 15700 KB Output is correct
44 Correct 463 ms 17224 KB Output is correct
45 Correct 482 ms 17268 KB Output is correct
46 Correct 440 ms 15704 KB Output is correct
47 Correct 500 ms 15788 KB Output is correct
48 Correct 470 ms 15732 KB Output is correct
49 Correct 520 ms 17196 KB Output is correct
50 Correct 439 ms 15388 KB Output is correct
51 Correct 462 ms 16260 KB Output is correct
52 Correct 473 ms 17196 KB Output is correct
53 Correct 409 ms 14416 KB Output is correct
54 Correct 534 ms 15412 KB Output is correct
55 Correct 568 ms 16252 KB Output is correct
56 Correct 573 ms 17268 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 5 ms 492 KB Output is correct
30 Correct 7 ms 460 KB Output is correct
31 Correct 7 ms 460 KB Output is correct
32 Correct 8 ms 460 KB Output is correct
33 Correct 6 ms 460 KB Output is correct
34 Correct 7 ms 460 KB Output is correct
35 Correct 7 ms 460 KB Output is correct
36 Correct 5 ms 460 KB Output is correct
37 Correct 6 ms 464 KB Output is correct
38 Correct 7 ms 460 KB Output is correct
39 Correct 7 ms 460 KB Output is correct
40 Correct 7 ms 460 KB Output is correct
41 Correct 6 ms 540 KB Output is correct
42 Correct 6 ms 460 KB Output is correct
43 Correct 7 ms 468 KB Output is correct
44 Correct 8 ms 460 KB Output is correct
45 Correct 7 ms 460 KB Output is correct
46 Correct 7 ms 460 KB Output is correct
47 Correct 6 ms 460 KB Output is correct
48 Correct 8 ms 544 KB Output is correct
49 Correct 7 ms 548 KB Output is correct
50 Correct 8 ms 460 KB Output is correct
51 Correct 6 ms 460 KB Output is correct
52 Correct 7 ms 460 KB Output is correct
53 Correct 7 ms 460 KB Output is correct
54 Correct 7 ms 460 KB Output is correct
55 Execution timed out 2077 ms 11808 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 5 ms 492 KB Output is correct
30 Correct 7 ms 460 KB Output is correct
31 Correct 7 ms 460 KB Output is correct
32 Correct 8 ms 460 KB Output is correct
33 Correct 6 ms 460 KB Output is correct
34 Correct 7 ms 460 KB Output is correct
35 Correct 7 ms 460 KB Output is correct
36 Correct 5 ms 460 KB Output is correct
37 Correct 6 ms 464 KB Output is correct
38 Correct 7 ms 460 KB Output is correct
39 Correct 7 ms 460 KB Output is correct
40 Correct 7 ms 460 KB Output is correct
41 Correct 6 ms 540 KB Output is correct
42 Correct 6 ms 460 KB Output is correct
43 Correct 7 ms 468 KB Output is correct
44 Correct 8 ms 460 KB Output is correct
45 Correct 7 ms 460 KB Output is correct
46 Correct 7 ms 460 KB Output is correct
47 Correct 6 ms 460 KB Output is correct
48 Correct 8 ms 544 KB Output is correct
49 Correct 7 ms 548 KB Output is correct
50 Correct 8 ms 460 KB Output is correct
51 Correct 6 ms 460 KB Output is correct
52 Correct 7 ms 460 KB Output is correct
53 Correct 7 ms 460 KB Output is correct
54 Correct 7 ms 460 KB Output is correct
55 Correct 124 ms 15688 KB Output is correct
56 Correct 132 ms 17256 KB Output is correct
57 Correct 139 ms 16968 KB Output is correct
58 Correct 123 ms 15716 KB Output is correct
59 Correct 127 ms 15608 KB Output is correct
60 Correct 126 ms 14996 KB Output is correct
61 Correct 120 ms 15684 KB Output is correct
62 Correct 133 ms 17276 KB Output is correct
63 Correct 121 ms 15804 KB Output is correct
64 Correct 129 ms 16960 KB Output is correct
65 Correct 121 ms 14572 KB Output is correct
66 Correct 126 ms 15096 KB Output is correct
67 Correct 137 ms 16280 KB Output is correct
68 Correct 139 ms 17344 KB Output is correct
69 Correct 438 ms 15700 KB Output is correct
70 Correct 463 ms 17224 KB Output is correct
71 Correct 482 ms 17268 KB Output is correct
72 Correct 440 ms 15704 KB Output is correct
73 Correct 500 ms 15788 KB Output is correct
74 Correct 470 ms 15732 KB Output is correct
75 Correct 520 ms 17196 KB Output is correct
76 Correct 439 ms 15388 KB Output is correct
77 Correct 462 ms 16260 KB Output is correct
78 Correct 473 ms 17196 KB Output is correct
79 Correct 409 ms 14416 KB Output is correct
80 Correct 534 ms 15412 KB Output is correct
81 Correct 568 ms 16252 KB Output is correct
82 Correct 573 ms 17268 KB Output is correct
83 Execution timed out 2077 ms 11808 KB Time limit exceeded
84 Halted 0 ms 0 KB -