#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
struct edge {
int from;
int to;
edge(){};
edge(int _from, int _to) : from(_from), to(_to){};
};
variant<bool, vector<int>> find_journey(int n, int m, vector<int> A, vector<int> B) {
vector<edge> edges;
vector<set<int>> g(n);
vector<set<int>> rev_g(n);
auto rev = [&](int e) {
int u = edges[e].from, v = edges[e].to;
g[u].erase(e);
rev_g[v].erase(e);
};
auto add = [&](int e) {
int u = edges[e].from, v = edges[e].to;
g[u].insert(e);
rev_g[v].insert(e);
};
for (int i = 0; i < m; i++) {
edges.emplace_back(A[i], B[i]);
add(i);
}
int st = 0;
vector<int> trail;
set<pair<int, int>> pos;
for (int i = 0; i < n; i++) {
pos.insert(make_pair(g[i].size(), i));
}
while (true) {
bool change = false;
while (pos.size() && pos.begin()->first == 0) {
int v = pos.begin()->second;
pos.erase(pos.begin());
change = true;
vector<int> make;
for (int e : rev_g[v]) {
make.push_back(e);
}
for (int e : make) {
int u = edges[e].from;
pos.erase(make_pair(g[u].size(), u));
rev(e);
pos.insert(make_pair(g[u].size(), u));
}
}
while (g[st].size() < 2) {
if (g[st].empty()) {
return false;
}
vector<int> make;
for (int e : rev_g[st]) {
make.push_back(e);
}
for (int e : make) {
if (trail.size() && e == trail.back()) {
continue;
}
change = true;
int u = edges[e].from;
pos.erase(make_pair(g[u].size(), u));
rev(e);
pos.insert(make_pair(g[u].size(), u));
}
int e = *g[st].begin();
st = edges[e].to;
trail.push_back(e);
}
if (!change) {
break;
}
}
vector<int> path;
vector<int> cyc;
vector<bool> was(n);
vector<bool> in_queque(n);
vector<int> que;
vector<int> ed;
function<bool(int)> dfs = [&](int v) {
was[v] = true;
in_queque[v] = true;
que.push_back(v);
for (int e : g[v]) {
int u = edges[e].to;
if (in_queque[u]) {
bool done = false;
for (int es : ed) {
if (edges[es].from != u && !done) {
path.push_back(es);
} else {
cyc.push_back(es);
done = true;
}
}
cyc.push_back(e);
return true;
}
if (was[u]) {
continue;
}
ed.push_back(e);
if (dfs(u)) {
return true;
}
ed.pop_back();
}
in_queque[v] = false;
que.pop_back();
return false;
};
vector<int> path1, path2, cyc1, cyc2;
if (!dfs(st)) {
return false;
}
path1 = path;
cyc1 = cyc;
fill(in_queque.begin(), in_queque.end(), false);
fill(was.begin(), was.end(), false);
path.clear();
cyc.clear();
que.clear();
ed.clear();
for (int e : cyc1) {
rev(e);
swap(edges[e].from, edges[e].to);
add(e);
}
for (int e : cyc1) {
int v = edges[e].from;
vector<int> r;
if (v != st) {
for (int es : g[v]) {
if (es != e) {
r.push_back(es);
}
}
} else {
assert(path1.empty());
}
for (int es : r) {
rev(es);
}
}
if (path1.empty()) {
for (int e : cyc1) {
int v = edges[e].from;
if (v == st) {
for (int es : g[v]) {
if (es == e) {
continue;
}
int u = edges[es].to;
vector<int> make;
for (int E : g[v]) {
if (E != e) {
make.push_back(E);
}
}
for (int E : make) {
rev(E);
}
assert(dfs(u));
path2 = path;
cyc2 = cyc;
path2.insert(path2.begin(), es);
break;
}
assert(cyc2.size() && path2.size());
break;
}
}
} else {
int e = path1[0];
assert(edges[e].from == st);
rev(e);
assert(dfs(st));
path2 = path;
cyc2 = cyc;
}
vector<int> ret;
auto add_way = [&](vector<int> &a) {
for (int e : a) {
ret.push_back(e);
}
reverse(a.begin(), a.end());
};
bool same = false;
{
int sam = edges[cyc1[0]].from;
for (int e : cyc2) {
int v = edges[e].from;
if (v == sam) {
same = true;
}
}
}
add_way(trail);
for (int rot = 0; rot < (same ? 1 : 2); rot++) {
add_way(path1);
add_way(cyc1);
add_way(path1);
add_way(path2);
add_way(cyc2);
add_way(path2);
}
add_way(trail);
return ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 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 |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
130 ms |
24720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
228 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
151 ms |
19528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
852 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
596 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
468 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
320 KB |
Output is correct |
10 |
Correct |
2 ms |
596 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
2 ms |
700 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
79 ms |
12156 KB |
Output is correct |
18 |
Correct |
56 ms |
10028 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
212 KB |
Output is correct |
21 |
Correct |
0 ms |
212 KB |
Output is correct |
22 |
Correct |
0 ms |
212 KB |
Output is correct |
23 |
Correct |
155 ms |
19088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
3 ms |
684 KB |
Output is correct |
3 |
Correct |
197 ms |
21824 KB |
Output is correct |
4 |
Correct |
214 ms |
22128 KB |
Output is correct |
5 |
Correct |
2 ms |
852 KB |
Output is correct |
6 |
Correct |
2 ms |
852 KB |
Output is correct |
7 |
Correct |
1 ms |
296 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 |
724 KB |
Output is correct |
11 |
Correct |
3 ms |
852 KB |
Output is correct |
12 |
Correct |
3 ms |
852 KB |
Output is correct |
13 |
Correct |
3 ms |
980 KB |
Output is correct |
14 |
Correct |
2 ms |
836 KB |
Output is correct |
15 |
Correct |
4 ms |
1228 KB |
Output is correct |
16 |
Correct |
2 ms |
596 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
3 ms |
852 KB |
Output is correct |
19 |
Correct |
2 ms |
596 KB |
Output is correct |
20 |
Correct |
225 ms |
23996 KB |
Output is correct |
21 |
Correct |
237 ms |
22208 KB |
Output is correct |
22 |
Correct |
2 ms |
596 KB |
Output is correct |
23 |
Correct |
1 ms |
468 KB |
Output is correct |
24 |
Correct |
1 ms |
212 KB |
Output is correct |
25 |
Correct |
2 ms |
468 KB |
Output is correct |
26 |
Correct |
2 ms |
724 KB |
Output is correct |
27 |
Correct |
211 ms |
23464 KB |
Output is correct |
28 |
Correct |
214 ms |
23224 KB |
Output is correct |
29 |
Correct |
1 ms |
212 KB |
Output is correct |
30 |
Correct |
271 ms |
24724 KB |
Output is correct |
31 |
Correct |
0 ms |
212 KB |
Output is correct |
32 |
Correct |
209 ms |
22212 KB |
Output is correct |
33 |
Correct |
210 ms |
23196 KB |
Output is correct |
34 |
Correct |
65 ms |
12508 KB |
Output is correct |
35 |
Correct |
1 ms |
468 KB |
Output is correct |
36 |
Correct |
197 ms |
19768 KB |
Output is correct |
37 |
Correct |
192 ms |
23596 KB |
Output is correct |
38 |
Correct |
2 ms |
596 KB |
Output is correct |
39 |
Correct |
181 ms |
19076 KB |
Output is correct |
40 |
Correct |
2 ms |
724 KB |
Output is correct |
41 |
Correct |
286 ms |
24672 KB |
Output is correct |
42 |
Correct |
215 ms |
23440 KB |
Output is correct |
43 |
Correct |
0 ms |
212 KB |
Output is correct |
44 |
Correct |
3 ms |
852 KB |
Output is correct |
45 |
Correct |
2 ms |
724 KB |
Output is correct |
46 |
Correct |
51 ms |
9872 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 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 |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
130 ms |
24720 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 |
228 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
151 ms |
19528 KB |
Output is correct |
14 |
Correct |
2 ms |
852 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
2 ms |
596 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
468 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
22 |
Correct |
1 ms |
320 KB |
Output is correct |
23 |
Correct |
2 ms |
596 KB |
Output is correct |
24 |
Correct |
0 ms |
212 KB |
Output is correct |
25 |
Correct |
2 ms |
700 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
27 |
Correct |
1 ms |
212 KB |
Output is correct |
28 |
Correct |
1 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
212 KB |
Output is correct |
30 |
Correct |
79 ms |
12156 KB |
Output is correct |
31 |
Correct |
56 ms |
10028 KB |
Output is correct |
32 |
Correct |
1 ms |
212 KB |
Output is correct |
33 |
Correct |
0 ms |
212 KB |
Output is correct |
34 |
Correct |
0 ms |
212 KB |
Output is correct |
35 |
Correct |
0 ms |
212 KB |
Output is correct |
36 |
Correct |
155 ms |
19088 KB |
Output is correct |
37 |
Correct |
0 ms |
212 KB |
Output is correct |
38 |
Correct |
0 ms |
212 KB |
Output is correct |
39 |
Correct |
1 ms |
212 KB |
Output is correct |
40 |
Correct |
1 ms |
340 KB |
Output is correct |
41 |
Correct |
115 ms |
11220 KB |
Output is correct |
42 |
Correct |
5 ms |
988 KB |
Output is correct |
43 |
Correct |
136 ms |
19540 KB |
Output is correct |
44 |
Correct |
141 ms |
19484 KB |
Output is correct |
45 |
Correct |
156 ms |
19604 KB |
Output is correct |
46 |
Correct |
1 ms |
212 KB |
Output is correct |
47 |
Correct |
0 ms |
212 KB |
Output is correct |
48 |
Correct |
0 ms |
212 KB |
Output is correct |
49 |
Correct |
1 ms |
596 KB |
Output is correct |
50 |
Correct |
160 ms |
35400 KB |
Output is correct |
51 |
Correct |
351 ms |
38368 KB |
Output is correct |
52 |
Correct |
335 ms |
38044 KB |
Output is correct |
53 |
Correct |
347 ms |
37780 KB |
Output is correct |
54 |
Correct |
336 ms |
37876 KB |
Output is correct |
55 |
Correct |
331 ms |
37772 KB |
Output is correct |
56 |
Correct |
342 ms |
37888 KB |
Output is correct |
57 |
Correct |
169 ms |
32276 KB |
Output is correct |
58 |
Correct |
166 ms |
34288 KB |
Output is correct |
59 |
Correct |
406 ms |
37888 KB |
Output is correct |
60 |
Correct |
410 ms |
37824 KB |
Output is correct |
61 |
Correct |
406 ms |
37824 KB |
Output is correct |
62 |
Correct |
45 ms |
10404 KB |
Output is correct |
63 |
Correct |
250 ms |
36572 KB |
Output is correct |
64 |
Correct |
137 ms |
12324 KB |
Output is correct |
65 |
Correct |
0 ms |
212 KB |
Output is correct |
66 |
Correct |
1 ms |
340 KB |
Output is correct |
67 |
Correct |
275 ms |
37884 KB |
Output is correct |
68 |
Correct |
362 ms |
23932 KB |
Output is correct |
69 |
Correct |
193 ms |
26264 KB |
Output is correct |
70 |
Correct |
2 ms |
724 KB |
Output is correct |
71 |
Correct |
272 ms |
24916 KB |
Output is correct |
72 |
Correct |
0 ms |
212 KB |
Output is correct |
73 |
Correct |
404 ms |
33596 KB |
Output is correct |
74 |
Correct |
166 ms |
37048 KB |
Output is correct |
75 |
Correct |
9 ms |
1748 KB |
Output is correct |
76 |
Correct |
65 ms |
17516 KB |
Output is correct |
77 |
Correct |
118 ms |
26908 KB |
Output is correct |
78 |
Correct |
426 ms |
37808 KB |
Output is correct |
79 |
Correct |
0 ms |
212 KB |
Output is correct |
80 |
Correct |
407 ms |
45116 KB |
Output is correct |
81 |
Correct |
1 ms |
596 KB |
Output is correct |
82 |
Correct |
239 ms |
24136 KB |
Output is correct |
83 |
Correct |
1 ms |
468 KB |
Output is correct |
84 |
Correct |
0 ms |
212 KB |
Output is correct |
85 |
Correct |
64 ms |
17048 KB |
Output is correct |
86 |
Correct |
2 ms |
724 KB |
Output is correct |
87 |
Correct |
18 ms |
11628 KB |
Output is correct |
88 |
Correct |
5 ms |
1172 KB |
Output is correct |
89 |
Correct |
408 ms |
37820 KB |
Output is correct |
90 |
Correct |
402 ms |
38080 KB |
Output is correct |
91 |
Correct |
439 ms |
43840 KB |
Output is correct |
92 |
Correct |
0 ms |
212 KB |
Output is correct |