#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) ((int)size(x))
#define trace(x) cout << #x << ": " << (x) << endl;
typedef long long ll;
const int N = 1000, M = 100000;
int A[M], B[M], C[2][M];
bool e[N][N];
vector<pair<int, int>> adj[N];
vector<pair<int, int>> g[2][M];
vector<int> st;
bool used[2][M];
bool usd[N];
void dfs(int t, int v, pair<int, int> p) {
used[t][v] = true;
usd[C[t][v]] = true;
st.emplace_back(C[t][v]);
for (auto to: g[t][v]) {
if (to != p) {
if (used[to.first][to.second]) {
memset(usd, 0, sizeof(usd));
cout << C[to.first][to.second] + 1 << " ";
int lst = C[to.first][to.second];
int wow = 0;
while (true) {
auto u = st.back();
cout << u + 1 << " ";
if (wow && e[u][lst]) {
break;
}
++wow;
st.pop_back();
}
exit(0);
}
}
}
for (auto to: g[t][v]) {
if (to != p) {
if (!used[to.first][to.second]) {
dfs(to.first, to.second, {t, v});
}
}
}
usd[C[t][v]] = false;
st.pop_back();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, r;
cin >> n >> r;
for (int i = 0; i < r; ++i) {
cin >> A[i] >> B[i];
--A[i], --B[i];
C[0][i] = A[i];
C[1][i] = B[i];
adj[A[i]].emplace_back(B[i], i);
adj[B[i]].emplace_back(A[i], i);
e[A[i]][B[i]] = e[B[i]][A[i]] = true;
}
for (int v = 0; v < n; ++v) {
for (auto [a, i]: adj[v]) {
for (auto [b, j]: adj[v]) {
if (i != j && !e[a][b]) {
int t1 = (B[i] == a);
int t2 = (B[j] == v);
g[t1][i].emplace_back(t2, j);
}
}
}
}
for (int v = 0; v < r; ++v) {
if (!used[0][v]) {
dfs(0, v, {-1, -1});
}
if (!used[1][v]) {
dfs(1, v, {-1, -1});
}
}
cout << "no";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
5076 KB |
Output is correct |
2 |
Incorrect |
3 ms |
5076 KB |
Wrong answer on graph without induced cycle |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
5076 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
5076 KB |
Output is correct |
2 |
Incorrect |
2 ms |
5076 KB |
Wrong answer on graph without induced cycle |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
5204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
5588 KB |
Wrong adjacency |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
5844 KB |
Wrong answer on graph without induced cycle |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
24 ms |
16984 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
101 ms |
35940 KB |
Repeated vertex |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
229 ms |
192720 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
121 ms |
9524 KB |
Too short sequence |
2 |
Correct |
125 ms |
9164 KB |
Output is correct |
3 |
Correct |
297 ms |
172068 KB |
Output is correct |
4 |
Runtime error |
458 ms |
349144 KB |
Execution killed with signal 11 |
5 |
Halted |
0 ms |
0 KB |
- |