# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995062 | otarius | Library (JOI18_library) | C++17 | 19 ms | 344 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 "library.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define sc second
#define pb push_back
#define pii pair<int, int>
void Solve(int n) {
vector<int> ans(n + 1);
vector<int> v(n, 1);
for (int i = 1; i <= n; i++) {
v[i - 1] = 0;
if (Query(v) == 1) {
ans[1] = i; break;
} v[i - 1] = 1;
} bool used[n + 1];
used[ans[1]] = 1;
for (int i = 2; i <= n; i++) {
vector<int> cur;
for (int j = 1; j <= n; j++)
if (!used[j]) cur.pb(j);
int l = 0, r = cur.size() - 1, m, an;
while (l <= r) {
m = (l + r) / 2;
vector<int> bl(n, 0);
bl[ans[i - 1]] = 1;
for (int k = 0; k <= m; k++)
bl[cur[k]] = 1;
int vl = Query(bl);
bl[ans[i - 1]] = 0;
int now = Query(bl);
if (vl != now) l = m + 1;
else {
an = m; r = m - 1;
}
} ans[i] = an; used[an] = 1;
} ans.erase(ans.begin());
Answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |