#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
void dfs(int cur, vector<bool> &visited, vector<vector<int>> &adjacency, int erased) {
visited[cur] = true;
for (auto &i : adjacency[cur]) {
if (visited[i] || i == erased) continue;
dfs(i, visited, adjacency, erased);
}
}
int countComponents(int erased, int N, vector<vector<int>> &adjacency) {
vector<bool> visited(N, false);
int cnt = 1;
for (int i = 0; i < N; ++i) {
if (visited[i]) continue;
dfs(i, visited, adjacency, erased);
++cnt;
}
return cnt;
}
std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
vector<int> G(N, -1);
vector<vector<int>> adjacency(N);
for (int i = 0; i < X.size(); ++i) {
adjacency[X[i]].push_back(Y[i]);
adjacency[Y[i]].push_back(X[i]);
}
for (int i = 0; i < N; ++i) {
int expected = countComponents(i, N, adjacency);
for (int colour = 0; colour < N; ++colour) {
vector<int> E(N, colour);
E[i] = -1;
int cur = perform_experiment(E);
if (cur < expected) {
G[i] = colour;
break;
}
}
}
return G;
}
