답안 #395413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
395413	2021-04-28T10:36:25 Z	wenqi	Joker (BOI20_joker)	C++14	49 / 100	2000 ms	17292 KB

Joker

#include <bits/stdc++.h>

using namespace std;

int N, M, Q;

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

int ans[600069];

#define ROOT 600

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

#	결과	실행 시간	메모리	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	2 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	3 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	336 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	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	2 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	3 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	336 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	30 ms	476 KB	Output is correct
30	Correct	40 ms	548 KB	Output is correct
31	Correct	33 ms	536 KB	Output is correct
32	Correct	33 ms	532 KB	Output is correct
33	Correct	30 ms	460 KB	Output is correct
34	Correct	35 ms	544 KB	Output is correct
35	Correct	36 ms	460 KB	Output is correct
36	Correct	26 ms	460 KB	Output is correct
37	Correct	29 ms	544 KB	Output is correct
38	Correct	30 ms	568 KB	Output is correct
39	Correct	30 ms	460 KB	Output is correct
40	Correct	33 ms	460 KB	Output is correct
41	Correct	38 ms	528 KB	Output is correct
42	Correct	35 ms	536 KB	Output is correct
43	Correct	35 ms	460 KB	Output is correct
44	Correct	32 ms	552 KB	Output is correct
45	Correct	34 ms	540 KB	Output is correct
46	Correct	34 ms	460 KB	Output is correct
47	Correct	27 ms	460 KB	Output is correct
48	Correct	32 ms	532 KB	Output is correct
49	Correct	30 ms	460 KB	Output is correct
50	Correct	31 ms	460 KB	Output is correct
51	Correct	30 ms	524 KB	Output is correct
52	Correct	37 ms	528 KB	Output is correct
53	Correct	32 ms	480 KB	Output is correct
54	Correct	35 ms	556 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	130 ms	15712 KB	Output is correct
4	Correct	137 ms	17184 KB	Output is correct
5	Correct	148 ms	16916 KB	Output is correct
6	Correct	126 ms	15652 KB	Output is correct
7	Correct	129 ms	15696 KB	Output is correct
8	Correct	126 ms	15016 KB	Output is correct
9	Correct	129 ms	15684 KB	Output is correct
10	Correct	131 ms	17292 KB	Output is correct
11	Correct	128 ms	15712 KB	Output is correct
12	Correct	142 ms	16908 KB	Output is correct
13	Correct	128 ms	14388 KB	Output is correct
14	Correct	133 ms	15108 KB	Output is correct
15	Correct	134 ms	16308 KB	Output is correct
16	Correct	136 ms	17292 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	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	2 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	3 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	336 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	130 ms	15712 KB	Output is correct
30	Correct	137 ms	17184 KB	Output is correct
31	Correct	148 ms	16916 KB	Output is correct
32	Correct	126 ms	15652 KB	Output is correct
33	Correct	129 ms	15696 KB	Output is correct
34	Correct	126 ms	15016 KB	Output is correct
35	Correct	129 ms	15684 KB	Output is correct
36	Correct	131 ms	17292 KB	Output is correct
37	Correct	128 ms	15712 KB	Output is correct
38	Correct	142 ms	16908 KB	Output is correct
39	Correct	128 ms	14388 KB	Output is correct
40	Correct	133 ms	15108 KB	Output is correct
41	Correct	134 ms	16308 KB	Output is correct
42	Correct	136 ms	17292 KB	Output is correct
43	Correct	1161 ms	15716 KB	Output is correct
44	Correct	1261 ms	17248 KB	Output is correct
45	Correct	1195 ms	17224 KB	Output is correct
46	Correct	1264 ms	15684 KB	Output is correct
47	Correct	1393 ms	15644 KB	Output is correct
48	Correct	1400 ms	15660 KB	Output is correct
49	Correct	1481 ms	17244 KB	Output is correct
50	Correct	1108 ms	15452 KB	Output is correct
51	Correct	1236 ms	16300 KB	Output is correct
52	Correct	1264 ms	17204 KB	Output is correct
53	Correct	1160 ms	14516 KB	Output is correct
54	Correct	1492 ms	15384 KB	Output is correct
55	Correct	1551 ms	16316 KB	Output is correct
56	Correct	1563 ms	17228 KB	Output is correct

Subtask #5
0 / 22.0

#	결과	실행 시간	메모리	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	2 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	3 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	336 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	30 ms	476 KB	Output is correct
30	Correct	40 ms	548 KB	Output is correct
31	Correct	33 ms	536 KB	Output is correct
32	Correct	33 ms	532 KB	Output is correct
33	Correct	30 ms	460 KB	Output is correct
34	Correct	35 ms	544 KB	Output is correct
35	Correct	36 ms	460 KB	Output is correct
36	Correct	26 ms	460 KB	Output is correct
37	Correct	29 ms	544 KB	Output is correct
38	Correct	30 ms	568 KB	Output is correct
39	Correct	30 ms	460 KB	Output is correct
40	Correct	33 ms	460 KB	Output is correct
41	Correct	38 ms	528 KB	Output is correct
42	Correct	35 ms	536 KB	Output is correct
43	Correct	35 ms	460 KB	Output is correct
44	Correct	32 ms	552 KB	Output is correct
45	Correct	34 ms	540 KB	Output is correct
46	Correct	34 ms	460 KB	Output is correct
47	Correct	27 ms	460 KB	Output is correct
48	Correct	32 ms	532 KB	Output is correct
49	Correct	30 ms	460 KB	Output is correct
50	Correct	31 ms	460 KB	Output is correct
51	Correct	30 ms	524 KB	Output is correct
52	Correct	37 ms	528 KB	Output is correct
53	Correct	32 ms	480 KB	Output is correct
54	Correct	35 ms	556 KB	Output is correct
55	Correct	1276 ms	11852 KB	Output is correct
56	Execution timed out	2076 ms	13424 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

Subtask #6
0 / 29.0

#	결과	실행 시간	메모리	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	2 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	332 KB	Output is correct
14	Correct	3 ms	332 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	336 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	30 ms	476 KB	Output is correct
30	Correct	40 ms	548 KB	Output is correct
31	Correct	33 ms	536 KB	Output is correct
32	Correct	33 ms	532 KB	Output is correct
33	Correct	30 ms	460 KB	Output is correct
34	Correct	35 ms	544 KB	Output is correct
35	Correct	36 ms	460 KB	Output is correct
36	Correct	26 ms	460 KB	Output is correct
37	Correct	29 ms	544 KB	Output is correct
38	Correct	30 ms	568 KB	Output is correct
39	Correct	30 ms	460 KB	Output is correct
40	Correct	33 ms	460 KB	Output is correct
41	Correct	38 ms	528 KB	Output is correct
42	Correct	35 ms	536 KB	Output is correct
43	Correct	35 ms	460 KB	Output is correct
44	Correct	32 ms	552 KB	Output is correct
45	Correct	34 ms	540 KB	Output is correct
46	Correct	34 ms	460 KB	Output is correct
47	Correct	27 ms	460 KB	Output is correct
48	Correct	32 ms	532 KB	Output is correct
49	Correct	30 ms	460 KB	Output is correct
50	Correct	31 ms	460 KB	Output is correct
51	Correct	30 ms	524 KB	Output is correct
52	Correct	37 ms	528 KB	Output is correct
53	Correct	32 ms	480 KB	Output is correct
54	Correct	35 ms	556 KB	Output is correct
55	Correct	130 ms	15712 KB	Output is correct
56	Correct	137 ms	17184 KB	Output is correct
57	Correct	148 ms	16916 KB	Output is correct
58	Correct	126 ms	15652 KB	Output is correct
59	Correct	129 ms	15696 KB	Output is correct
60	Correct	126 ms	15016 KB	Output is correct
61	Correct	129 ms	15684 KB	Output is correct
62	Correct	131 ms	17292 KB	Output is correct
63	Correct	128 ms	15712 KB	Output is correct
64	Correct	142 ms	16908 KB	Output is correct
65	Correct	128 ms	14388 KB	Output is correct
66	Correct	133 ms	15108 KB	Output is correct
67	Correct	134 ms	16308 KB	Output is correct
68	Correct	136 ms	17292 KB	Output is correct
69	Correct	1161 ms	15716 KB	Output is correct
70	Correct	1261 ms	17248 KB	Output is correct
71	Correct	1195 ms	17224 KB	Output is correct
72	Correct	1264 ms	15684 KB	Output is correct
73	Correct	1393 ms	15644 KB	Output is correct
74	Correct	1400 ms	15660 KB	Output is correct
75	Correct	1481 ms	17244 KB	Output is correct
76	Correct	1108 ms	15452 KB	Output is correct
77	Correct	1236 ms	16300 KB	Output is correct
78	Correct	1264 ms	17204 KB	Output is correct
79	Correct	1160 ms	14516 KB	Output is correct
80	Correct	1492 ms	15384 KB	Output is correct
81	Correct	1551 ms	16316 KB	Output is correct
82	Correct	1563 ms	17228 KB	Output is correct
83	Correct	1276 ms	11852 KB	Output is correct
84	Execution timed out	2076 ms	13424 KB	Time limit exceeded
85	Halted	0 ms	0 KB	-

답안 #395413

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 8.0 / 8.0

Subtask #3 25.0 / 25.0

Subtask #4 10.0 / 10.0

Subtask #5 0 / 22.0

Subtask #6 0 / 29.0

Subtask #1
6.0 / 6.0

Subtask #2
8.0 / 8.0

Subtask #3
25.0 / 25.0

Subtask #4
10.0 / 10.0

Subtask #5
0 / 22.0

Subtask #6
0 / 29.0