#include "sphinx.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
vector<signed> find_colours(signed N, vector<signed> X, vector<signed> Y) {
int M = big(X);
vector<signed> ans(N);
for (int i = 0;i<N;i++) {
int l = 0;
int r = N-1;
while (l<=r) {
int m = (l+r) >> 1;
vector<signed> toask(N,N);
int ctr = m-1;
for (int j = 0;j<N;j++) {
if (i != j && ctr>=0) {
toask[j] = ctr;
ctr--;
}
}
toask[i] = -1;
int lmao = perform_experiment(toask);
int normalne = m+2;
if (lmao == m+(m != N-1)+1) l = m+1;
else r = m-1;
}
ans[i] = r;
}
return ans;
}
# | 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... |