This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve(int N) {
vector<int> ans(N);
for (int i = 0; i < N; i++) {
int l = 0, r = N - 1;
while (l != r) {
int mid = (l + r) / 2;
vector<int> tst(N, 0);
for (int j = l; j <= mid; j++) tst[j] = i + 1;
if (query(tst)) r = mid;
else l = mid + 1;
}
ans[l] = i + 1;
}
query(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... |