oj.uz

Submission #776832

# Submission time Handle Problem Language Result Execution time Memory
776832 2023-07-08T10:08:09 Z SanguineChameleon Thousands Islands (IOI22_islands) C++17
100 / 100
 105 ms 19360 KB 
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 1e5 + 20;
vector<pair<int, int>> adj1[maxN];
vector<pair<int, int>> adj2[maxN];
pair<int, int> nxt[maxN];
pair<int, int> prv[maxN];
int deg[maxN];
bool rem[maxN];

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
	for (int i = 0; i < M; i++) {
		adj1[U[i]].emplace_back(V[i], i);
		adj2[V[i]].emplace_back(U[i], i);
		deg[U[i]]++;
	}
	deque<int> Q;
	for (int i = 0; i < N; i++) {
		if (deg[i] == 0) {
			rem[i] = true;
			Q.push_back(i);
		}
	}
	vector<int> pref;
	int start = 0;
	pair<int, int> nxt1, nxt2;
	while (true) {
		while (!Q.empty()) {
			int u = Q.front();
			Q.pop_front();
			for (auto e: adj2[u]) {
				int v = e.first;
				if (rem[v]) {
					continue;
				}
				deg[v]--;
				if (deg[v] == 0) {
					rem[v] = true;
					Q.push_back(v);
				}
			}
		}
		if (rem[start]) {
			return false;
		}
		nxt1 = {-1, -1};
		nxt2 = {-1, -1};
		for (auto e: adj1[start]) {
			if (!rem[e.first]) {
				if (nxt1.first == -1) {
					nxt1 = e;
				}
				else if (nxt2.first == -1) {
					nxt2 = e;
				}
			}
		}
		if (nxt1.first == -1) {
			return false;
		}
		if (nxt2.first == -1) {
			rem[start] = true;
			Q.push_back(start);
			start = nxt1.first;
			pref.push_back(nxt1.second);
		}
		else {
			break;
		}
	}
	for (int i = 0; i < N; i++) {
		if (rem[i] || i == start) {
			continue;
		}
		for (auto e: adj1[i]) {
			if (!rem[e.first]) {
				nxt[i] = e;
				break;
			}
		}
	}
	vector<int> res(pref.begin(), pref.end());
	bool has_start = false;
	bool done = false;
	for (int iter = -1; iter < 4; iter++) {
		for (int i = 0; i < N; i++) {
			prv[i] = {-1, -1};
		}
		int u = -1;
		int extra = -1;
		if (iter == 1 && has_start) {
			extra = nxt2.second;
			u = nxt2.first;
			prv[nxt2.first] = {nxt2.first, -1};
		}
		else {
			if (iter != 2 || !has_start) {
				nxt[start] = (iter == -1 ? nxt2 : ((iter & 1) ? nxt2 : nxt1));
			}
			u = start;
			prv[start] = {start, -1};
		}
		while (true) {
			int v = nxt[u].first;
			if (prv[v].first != -1) {
				if (iter == -1) {
					if (v == start) {
						swap(nxt1, nxt2);
					}
					break;
				}
				nxt[v] = {u, nxt[u].second};
				vector<int> cycle = {nxt[u].second};
				while (u != v) {
					if (iter == 1) {
						done |= (u == start);
					}
					cycle.push_back(prv[u].second);
					nxt[u] = prv[u];
					u = prv[u].first;
				}
				if (iter == 1) {
					done |= (u == start);
				}
				vector<int> suf;
				while (u != ((iter == 1 && has_start) ? nxt2.first : start)) {
					suf.push_back(prv[u].second);
					u = prv[u].first;
				}
				if (iter == 1 && has_start) {
					suf.push_back(extra);
				}
				res.insert(res.end(), suf.rbegin(), suf.rend());
				res.insert(res.end(), cycle.rbegin(), cycle.rend());
				res.insert(res.end(), suf.begin(), suf.end());
				if (iter == 0) {
					has_start = (v == start);
				}
				break;
			}
			else {
				prv[v] = {u, nxt[u].second};
				u = v;
			}
		}
		if (iter == 1 && has_start && done) {
			break;
		}
	}
	res.insert(res.end(), pref.rbegin(), pref.rend());
	return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 30 ms 11312 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5020 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 25 ms 10996 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5204 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5044 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 17 ms 8788 KB Output is correct
18 Correct 14 ms 8532 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 25 ms 10964 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 27 ms 11476 KB Output is correct
4 Correct 29 ms 11984 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4920 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5204 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 29 ms 12620 KB Output is correct
21 Correct 29 ms 12180 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 31 ms 12252 KB Output is correct
28 Correct 38 ms 12492 KB Output is correct
29 Correct 2 ms 4948 KB Output is correct
30 Correct 32 ms 13504 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 29 ms 12444 KB Output is correct
33 Correct 28 ms 12116 KB Output is correct
34 Correct 17 ms 8864 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 26 ms 11396 KB Output is correct
37 Correct 32 ms 13156 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 26 ms 11556 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 36 ms 13496 KB Output is correct
42 Correct 31 ms 12504 KB Output is correct
43 Correct 2 ms 4948 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 3 ms 5204 KB Output is correct
46 Correct 14 ms 8376 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 30 ms 11312 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 25 ms 10996 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 4 ms 5076 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 5044 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 2 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 2 ms 4948 KB Output is correct
30 Correct 17 ms 8788 KB Output is correct
31 Correct 14 ms 8532 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 25 ms 10964 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 3 ms 4896 KB Output is correct
39 Correct 3 ms 4924 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 15 ms 8276 KB Output is correct
42 Correct 3 ms 5204 KB Output is correct
43 Correct 27 ms 10272 KB Output is correct
44 Correct 26 ms 10268 KB Output is correct
45 Correct 27 ms 10748 KB Output is correct
46 Correct 2 ms 4948 KB Output is correct
47 Correct 2 ms 4948 KB Output is correct
48 Correct 2 ms 4948 KB Output is correct
49 Correct 3 ms 5076 KB Output is correct
50 Correct 90 ms 19360 KB Output is correct
51 Correct 57 ms 15660 KB Output is correct
52 Correct 59 ms 15612 KB Output is correct
53 Correct 77 ms 16680 KB Output is correct
54 Correct 68 ms 15564 KB Output is correct
55 Correct 58 ms 15640 KB Output is correct
56 Correct 57 ms 16432 KB Output is correct
57 Correct 43 ms 14828 KB Output is correct
58 Correct 67 ms 16476 KB Output is correct
59 Correct 59 ms 15544 KB Output is correct
60 Correct 68 ms 15208 KB Output is correct
61 Correct 59 ms 15400 KB Output is correct
62 Correct 15 ms 7252 KB Output is correct
63 Correct 54 ms 15200 KB Output is correct
64 Correct 19 ms 9300 KB Output is correct
65 Correct 2 ms 4948 KB Output is correct
66 Correct 2 ms 4948 KB Output is correct
67 Correct 74 ms 17320 KB Output is correct
68 Correct 33 ms 13488 KB Output is correct
69 Correct 32 ms 11500 KB Output is correct
70 Correct 3 ms 5076 KB Output is correct
71 Correct 40 ms 12400 KB Output is correct
72 Correct 2 ms 4948 KB Output is correct
73 Correct 54 ms 14896 KB Output is correct
74 Correct 97 ms 19112 KB Output is correct
75 Correct 5 ms 5460 KB Output is correct
76 Correct 34 ms 11012 KB Output is correct
77 Correct 35 ms 13268 KB Output is correct
78 Correct 59 ms 15304 KB Output is correct
79 Correct 2 ms 4948 KB Output is correct
80 Correct 105 ms 19132 KB Output is correct
81 Correct 3 ms 5076 KB Output is correct
82 Correct 30 ms 11952 KB Output is correct
83 Correct 2 ms 5076 KB Output is correct
84 Correct 3 ms 4948 KB Output is correct
85 Correct 29 ms 10436 KB Output is correct
86 Correct 3 ms 5076 KB Output is correct
87 Correct 3 ms 5844 KB Output is correct
88 Correct 3 ms 5204 KB Output is correct
89 Correct 58 ms 15152 KB Output is correct
90 Correct 73 ms 15392 KB Output is correct
91 Correct 90 ms 18408 KB Output is correct
92 Correct 3 ms 4948 KB Output is correct