Etäisyydet

input/code.cpp: In function 'bool fill(int, std::vector<int>&, int)':
input/code.cpp:25:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (c.size() == n) {
      ~~~~~~~~~^~~~

#include <bits/stdc++.h>
#include <unordered_map>
#define ll long long
#define ull unsigned long long

using namespace std;

bool visited[11];
int dist[11][11];
vector<int> v[11];

void find_distance(int start, int n, int prev, int c) {
	dist[start][n] = c;
	for (auto x : v[n]) {
		if (x != prev) {
			find_distance(start, x, n, c+1);
		}
	}
}

bool fill(int x, vector<int>& c, int n) {
	c.push_back(x);
	visited[x] = true;

	if (c.size() == n) {
		return true;
	}

	for (int i = 1; i <= n; i++) {
		if (visited[i]) continue;
		if (dist[i][x] > 3) continue;
		if (fill(i, c, n)) {
			return true;
		}
	}

	visited[x] = false;
	c.pop_back();
	return false;
}


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
//	istringstream cin(R"(2
//10
//1 2
//2 3
//3 4
//1 5
//5 6
//6 7
//1 8
//8 9
//9 10
//7
//1 2
//2 3
//3 4
//4 5
//1 6
//6 7)");

	ll t; cin >> t;

	for (int i = 0; i < t; i++) {
		int n; cin >> n;

		for (int x = 0; x < 11; x++) {
			visited[x] = false;
			v[x] = {};
		}

		for (int j = 0; j < n - 1; j++) {
			int a, b; cin >> a >> b;
			v[a].push_back(b);
			v[b].push_back(a);
		}

		for (int j = 1; j <= n; j++) {
			find_distance(j, j, 0, 0);
		}

		for (int j = 1; j <= n; j++) {
			vector<int> c;
			fill(j, c, n);
			if (c.size()) {
				for (auto item : c) {
					cout << item << " ";
				}

				break;
			}
		}

		cout << "\n";
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: RUNTIME ERROR