# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999205 | crafticat | Newspapers (CEOI21_newspapers) | C++17 | 1 ms | 856 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> g;
int MAX_DEP = 0;
vector<int> ans;
void dfs(int x, int p) {
ans.push_back(x);
for (auto child : g[x]) {
if (child == p) continue;
ans.push_back(child);
dfs(child,x);
}
ans.push_back(x);
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, m; cin >> n >> m;
g.resize(n + 1);
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
if (m != n -1) {
cout << "NO\n";
return 0;
}
dfs(1,0);
cout << "YES\n";
cout << ans.size() << "\n";
if (ans.size() > 5 * n) exit(5);
for (int an : ans) {
cout << an << " ";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |