# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081600 | kustizus | Library (JOI18_library) | C++17 | 2 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.
// #pragma GCC optimize("O3","unroll-loops")
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
// #define
// #define int long long
#define all(v) v.begin(), v.end()
#define fi first
#define se second
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
// declare
void Solve(int n)
{
int idx;
vector <int> m(n, 1);
for (int i = 1; i <= n; ++i)
{
m[i - 1] = 0;
int ans = Query(m);
if (ans == 1)
{
idx = i;
break;
}
}
vector <int> ans = {idx};
vector <bool> vs(n, false);
for (int i = 1; i < n; ++i){
vs[idx - 1] = true;
vector <int> now;
for (int j = 0; j < n; ++j)
if (!vs[j])
now.push_back(j);
int l = 1, r = now.size();
while (l < r){
int md = l + r >> 1;
vector <int> m(n, 0);
for (int i = l; i <= md; ++i)
m[now[i - 1] - 1] = 1;
int c1 = Query(m);
m[idx - 1] = 1;
int c2 = Query(m);
if (c1 == c2) r = md;
else l = md + 1;
}
ans.push_back(now[l - 1]);
idx = now[l - 1];
}
Answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |