oj.uz

Submission #629881

# Submission time Handle Problem Language Result Execution time Memory
629881 2022-08-15T09:56:08 Z prvocislo Thousands Islands (IOI22_islands) C++17
100 / 100
 385 ms 33600 KB 
#include "islands.h"
#include <variant>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;

variant<bool, vector<int>> find_journey(int n, int m, vector<int> U, vector<int> V) 
{
	vector<set<pair<int, int> > > g(n), gr(n);
	for (int i = 0; i < m; i++)
	{
		g[U[i]].insert({ V[i], i });
		gr[V[i]].insert({ U[i], i });
	}
	queue<int> q;
	for (int i = 0; i < n; i++)
	{
		if (g[i].empty()) q.push(i);
	}
	int vr = 0;
	vector<int> path, ans;
	while (true)
	{
		while (!q.empty())
		{
			int u = q.front();
			q.pop();
			for (pair<int, int> v : gr[u])
			{
				g[v.first].erase({ u, v.second });
				if (g[v.first].empty()) q.push(v.first);
			}
			gr[u].clear();
		}
		if (g[vr].empty()) return false;
		if (g[vr].size() == 1)
		{
			int i = g[vr].begin()->second;
			g[vr].clear();
			gr[V[i]].erase({ U[i], i });
			path.push_back(i);
			ans.push_back(i);
			q.push(vr);
			vr = V[i];
		}
		else break;
	}
	for (int i = 0; i < n; i++)
	{
		if (i == vr) g[i].erase(next(g[i].begin(), 2), g[i].end());
		else if (g[i].size()) g[i].erase(next(g[i].begin()), g[i].end());
	}
	vector<int> rev(m, 0);
	int cnt = 0, lst = -1;
	do
	{
		int i = g[vr].begin()->second;
		g[vr].erase(g[vr].begin());

		if (lst != -1) g[U[lst]].insert({ V[lst],lst });
		lst = i;
		ans.push_back(i);
		vr = V[i];
		swap(U[i], V[i]);

		if (rev[i]) cnt--;
		else cnt++;
		rev[i] ^= 1;

	} while (cnt);
	reverse(path.begin(), path.end());
	for (int i : path) ans.push_back(i);
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 118 ms 22984 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 176 ms 18408 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 85 ms 11716 KB Output is correct
18 Correct 67 ms 9376 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 160 ms 18380 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 176 ms 20716 KB Output is correct
4 Correct 200 ms 20772 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 864 KB Output is correct
14 Correct 2 ms 736 KB Output is correct
15 Correct 4 ms 992 KB Output is correct
16 Correct 1 ms 608 KB Output is correct
17 Correct 0 ms 224 KB Output is correct
18 Correct 2 ms 736 KB Output is correct
19 Correct 1 ms 608 KB Output is correct
20 Correct 184 ms 22108 KB Output is correct
21 Correct 190 ms 20816 KB Output is correct
22 Correct 1 ms 608 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 2 ms 480 KB Output is correct
26 Correct 1 ms 608 KB Output is correct
27 Correct 192 ms 21884 KB Output is correct
28 Correct 192 ms 21908 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 240 ms 22224 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 175 ms 20752 KB Output is correct
33 Correct 180 ms 21772 KB Output is correct
34 Correct 84 ms 11704 KB Output is correct
35 Correct 1 ms 480 KB Output is correct
36 Correct 170 ms 18452 KB Output is correct
37 Correct 193 ms 21888 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 181 ms 17124 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 203 ms 22220 KB Output is correct
42 Correct 203 ms 21876 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 68 ms 9428 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 118 ms 22984 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 176 ms 18408 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 85 ms 11716 KB Output is correct
31 Correct 67 ms 9376 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 160 ms 18380 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 103 ms 10136 KB Output is correct
42 Correct 3 ms 852 KB Output is correct
43 Correct 101 ms 15872 KB Output is correct
44 Correct 101 ms 15860 KB Output is correct
45 Correct 121 ms 15952 KB Output is correct
46 Correct 0 ms 224 KB Output is correct
47 Correct 0 ms 224 KB Output is correct
48 Correct 0 ms 224 KB Output is correct
49 Correct 1 ms 480 KB Output is correct
50 Correct 166 ms 23488 KB Output is correct
51 Correct 283 ms 31560 KB Output is correct
52 Correct 244 ms 31708 KB Output is correct
53 Correct 260 ms 32424 KB Output is correct
54 Correct 257 ms 31632 KB Output is correct
55 Correct 262 ms 31608 KB Output is correct
56 Correct 312 ms 31624 KB Output is correct
57 Correct 249 ms 28408 KB Output is correct
58 Correct 183 ms 23240 KB Output is correct
59 Correct 231 ms 31736 KB Output is correct
60 Correct 257 ms 31708 KB Output is correct
61 Correct 237 ms 31728 KB Output is correct
62 Correct 21 ms 8100 KB Output is correct
63 Correct 209 ms 30424 KB Output is correct
64 Correct 121 ms 11832 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 254 ms 32472 KB Output is correct
68 Correct 385 ms 22284 KB Output is correct
69 Correct 102 ms 20808 KB Output is correct
70 Correct 2 ms 596 KB Output is correct
71 Correct 190 ms 21472 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 264 ms 28852 KB Output is correct
74 Correct 186 ms 22124 KB Output is correct
75 Correct 7 ms 1620 KB Output is correct
76 Correct 60 ms 11292 KB Output is correct
77 Correct 87 ms 20700 KB Output is correct
78 Correct 255 ms 31652 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 344 ms 33600 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 222 ms 22224 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 56 ms 11272 KB Output is correct
86 Correct 2 ms 596 KB Output is correct
87 Correct 9 ms 8148 KB Output is correct
88 Correct 3 ms 980 KB Output is correct
89 Correct 283 ms 31688 KB Output is correct
90 Correct 231 ms 31696 KB Output is correct
91 Correct 283 ms 33080 KB Output is correct
92 Correct 0 ms 212 KB Output is correct