#include <bits/stdc++.h>
#include "sphinx.h"
using namespace std;
vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
vector<int> G(N, 0);
for (int i = 0; i < N; i++) {
int l = 0, r = N - 1;
while (l + 1 < r) {
int mid = (l + r) / 2;
vector<int> E(N, -1);
int cnt = l;
set<int> unique;
for (int j = 0; j < N; j++) {
if (i == j) continue;
E[j] = cnt;
unique.insert(cnt);
cnt = min(cnt + 1, mid);
}
int x = perform_experiment(E);
if (x == unique.size()) r = mid;
else l = mid;
}
vector<int> E(N, -1);
for (int j = 0; j < N; j++) {
if (i == j) continue;
E[j] = l;
}
if (perform_experiment(E) == 1) G[i] = l;
else G[i] = r;
}
return G;
}
