Task: | Distances |
Sender: | voventa |
Submission time: | 2021-01-31 16:03:09 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.01 s | 2 | details |
Code
#include <bits/stdc++.h> #define X first #define Y second #define sz(a) (int)a.size() #define pb push_back #define int long long using namespace std; typedef long long ll; void solve(); signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) solve(); return 0; } vector <int> g[110]; bitset <110> b, uncolor; vector <int> pans; void dfs2(int v, int d, int pr = -1) { if (d == 2 && !b[v]) { uncolor[v] = 1; return; } for (auto u : g[v]) { if (u != pr && !b[u]) dfs2(u, d + 1, v); } } void dfs(int v) { if (!uncolor[v]) pans.pb(v + 1); b[v] = 1; dfs2(v, 0); for (auto i : g[v]) { if (!b[i]) { dfs2(i, 0); dfs(i); } } if (uncolor[v]) pans.pb(v + 1); } /*/ 1 2 1 3 2 10 2 11 3 4 3 5 4 6 4 7 5 8 5 9 /*/ void solve() { b = 0; uncolor = 0; int n, x, y; cin >> n; for (int i = 0; i < n; ++i) { g[i].clear(); } pans.clear(); for (int i = 0; i < n - 1; ++i) { cin >> x >> y; x--; y--; g[x].pb(y); g[y].pb(x); } dfs(0); for (auto i : pans) { cout << i << " "; } cout << '\n'; return; }
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 8 5 2 2 3 3 7 ... |
correct output |
---|
1 8 2 5 6 7 3 4 1 7 2 8 3 6 4 5 1 4 6 2 7 5 8 3 1 8 3 2 4 7 6 5 1 6 4 7 5 2 3 8 ... |
user output |
---|
1 4 5 6 2 7 3 8 1 3 2 8 7 5 6 4 1 4 3 7 2 5 8 6 1 6 3 8 2 4 7 5 1 6 8 5 2 7 3 4 ... Truncated |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
100 100 37 59 81 37 44 81 ... |
correct output |
---|
1 99 82 81 59 5 71 55 17 24 13... |
user output |
---|
1 22 5 55 71 17 59 24 52 32 10... Truncated |