#include "sphinx.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn = 255;
int n, m;
int a[maxn];
bool ask(int v, int x) /// vryshta dali e ot rangea
{
vector < int > g;
int curr = 0;
int used = 0, is = 0;
for (int i = 0; i < n; ++ i)
{
if(i == v)g.pb(-1);
else if(curr <= x)
{
g.pb(curr);
used ++;
curr ++;
}
else
{
g.pb(n);
is = 1;
}
}
int fb = perform_experiment(g);
return (fb == used + is + 1);
}
std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y)
{
n = N;
m = X.size();
vector < int > res;
for (int i = 0; i < n; ++ i)
{
/// vyn vyn vyn vytre vytre vytre
/// pyrvoto pytre
int l = 0, r = n-2, mid, ans = n-1;
while(l <= r)
{
int mid = (l + r)/2;
if(ask(i, mid))
{
l = mid + 1;
}
else
{
ans = mid;
r = mid - 1;
}
}
res.pb(ans);
}
return res;
}
# | 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... |