#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] || i == erased) continue;
dfs(i, visited, adjacency, erased);
++cnt;
}
return cnt;
}
void findColours(vector<int> &G, int N, int mod) {
int half = N / 2;
vector<bool> erased(half, false);
for (int colour = 0; colour < N; ++colour) {
bool done = true;
for (int i = 0; i < N / 2; ++i) {
if (!erased[i]) {
done = false;
break;
}
}
if (done) return;
vector<int> E(N, N);
for (int i = 0; i < N / 2; ++i) {
if (erased[i]) continue;
E[i * 2 + mod] = -1;
E[i * 2 + 1 - mod] = colour;
}
int expected = 0;
int cur = -1;
for (int i = 0; i < N; ++i) {
if (E[i] != cur) ++expected;
cur = E[i];
}
if (perform_experiment(E) == expected) continue;
int remainCount = 0;
for (int i = 0; i < N / 2; ++i) {
if (erased[i]) continue;
++remainCount;
}
int left = 0, right = remainCount;
while (left < remainCount - 1) {
int mid = (left + right) / 2;
E.assign(N, N);
int cur = 0;
for (int i = 0; i < N / 2; ++i) {
if (cur == mid) break;
if (erased[i]) continue;
if (cur >= left) {
E[i * 2 + mod] = -1;
E[i * 2 + 1 - mod] = colour;
}
++cur;
}
int expected = 0;
cur = -1;
for (int i = 0; i < N; ++i) {
if (E[i] != cur) ++expected;
cur = E[i];
}
if (perform_experiment(E) < expected) right = mid;
else left = mid;
}
cur = 0;
for (int i = 0; i < N / 2; ++i) {
if (erased[i]) continue;
if (cur == left) {
G[i * 2 + mod] = colour;
break;
}
++cur;
}
--colour;
}
}
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]);
// }
findColours(G, N, 0);
findColours(G, N, 1);
if (N % 2) {
vector<int> E(N, N);
E[N - 1] = -1;
for (int colour = 0; colour < N; ++colour) {
E[N - 2] = colour;
if (perform_experiment(E) < 3) {
G[N - 1] = colour;
break;
}
}
}
return G;
}
