Etäisyydet

#include <iostream>
#include <vector>

using namespace std;

int t;
vector<int> v[101][101], o[101];

void dfs(int x, int p, int e) {
	if (e % 2) {
		o[t].push_back(x);
		for (int y : v[t][x])
			if (y != p) dfs(y, x, e+1);
	} else {
		for (int y : v[t][x])
			if (y != p) dfs(y, x, e+1);
		o[t].push_back(x);
	}
}

int main() {
	cin >> t;
	while (t --> 0) {
		int n;
		cin >> n;
		for (int i = 1; i < n; ++i) {
			int a, b;
			cin >> a >> b;
			v[t][a].push_back(b);
			v[t][b].push_back(a);
		}
		dfs(1, 0, 0);
		for (auto x : o[t]) cout << x << ' ';
		cout << endl;
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED