#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> g;
vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
n = N;
m = Y.size();
g.resize(n);
for (int i = 0; i < m; i++) {
g[X[i]].push_back(Y[i]);
g[Y[i]].push_back(X[i]);
}
vector<int> fin(n, -1);
for (int i = 0; i < n; i++) {
int lo = 0, hi = n-2;
int ans = n-1;
while (lo <= hi) {
vector<int> willAsk(n);
int mid = (lo + hi) / 2;
int curr = 0;
set<int> comps;
for (int j = 0; j < n; j++) {
if (j == i) willAsk[j] = -1;
else {
willAsk[j] = curr++;
}
if (curr > mid) curr = n;
comps.insert(willAsk[j]);
}
int tot = perform_experiment(willAsk);
if (tot != (int)comps.size()) {
ans = mid;
hi = mid-1;
}
else lo = mid+1;
}
fin[i] = ans;
}
return fin;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |