Task: | Distances |
Sender: | fishy15 |
Submission time: | 2021-01-31 02:32:03 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 29 |
#2 | ACCEPTED | 71 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 2 | details |
Code
#include <iostream>#include <iomanip>#include <fstream>#include <vector>#include <array>#include <algorithm>#include <utility>#include <map>#include <queue>#include <set>#include <cmath>#include <cstdio>#include <cstring>#include <functional>#define ll long long#define ld long double#define eps 1e-8#define MOD 1000000007#define INF 0x3f3f3f3f#define INFLL 0x3f3f3f3f3f3f3f3f// change if necessary#define MAXN 1000000using namespace std;void solve() {int n; cin >> n;vector<vector<int>> adj(n);for (int i = 0; i < n - 1; i++) {int a, b; cin >> a >> b;a--; b--;adj[a].push_back(b);adj[b].push_back(a);}function<void(int, int, bool)> dfs = [&](int v, int p, bool ok) {if (ok) cout << v + 1 << ' ';for (int e : adj[v]) {if (e != p) {dfs(e, v, !ok);}}if (!ok) cout << v + 1 << ' ';};dfs(0, 0, true);cout << '\n';}int main() {cin.tie(0)->sync_with_stdio(0);int t; cin >> t;while (t--) solve();return 0;}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
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 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 ... Truncated |
Test 2
Group: 2
Verdict: ACCEPTED
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 99 82 81 59 5 71 55 17 24 13... Truncated |