# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114781 | maruii | 도서관 (JOI18_library) | C++14 | 487 ms | 384 KiB |
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 <cstdio>
#include <vector>
#include "library.h"
using namespace std;
void Solve(int N)
{
vector<int> vec(N), res(N);
for (int i = 0, pre; i < N; ++i) {
int l = 0, r = N - 1;
while (l < r) {
int m = l + r >> 1;
int t, a, b;
vector<int> v = vec;
fill(v.begin() + l, v.begin() + m + 1, 1);
a = Query(v);
if (i == 0) {
for (auto &j: v) j ^= 1;
b = Query(v);
t = a >= b;
}
else {
v[pre] = 0;
b = Query(v);
if (i == 1) t = a == b;
else t = a < b;
}
if (t) r = m;
else l = m + 1;
}
vec[l] = 1;
pre = l;
res[i] = l + 1;
}
Answer(res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |