Etäisyydet

#include <bits/stdc++.h>
 
typedef long long ll;
 
#define M 1000000007
#define N (1 << 18)
 
using namespace std;
 
vector<int> v[101];
vector<int> ans;
 
void dfs(int s, int e, bool put) {
    if (put) {
        ans.push_back(s);
    }
 
    bool nxt = put ^ 1;
    for (int u : v[s]) {
        if (u == e) continue;
        dfs(u, s, nxt);
        nxt ^= 1;
    }
    if (!put) {
        ans.push_back(s);
    }
}
 
void test_case() {
	int n;
	cin >> n;
    for (int i = 1; i <= n; ++i) {
        v[i].clear();
    }
    ans.clear();
 
    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
 
    dfs(1, -1, 1);
 
    for (int x : ans) cout << x << " ";
 
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t = 0;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		test_case();
		cout << "\n";
	}
 
	return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER