# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133905 | duality | Library (JOI18_library) | C++11 | 520 ms | 456 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 <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#include "library.h"
void Solve(int N) {
if (N == 1) {
vi v;
v.pb(1);
Answer(v);
return;
}
int i;
vi M(N,1);
for (i = 0; i < N; i++) {
M[i] = 0;
if (Query(M) == 1) break;
else M[i] = 1;
}
vi ans,rem;
ans.pb(i);
for (i = 0; i < N; i++) {
if (i != ans.back()) rem.pb(i);
}
while (ans.size() < N) {
int l = 0,r = rem.size()-1;
while (l < r) {
int m = (l+r) / 2;
fill(M.begin(),M.end(),0);
for (i = l; i <= m; i++) M[rem[i]] = 1;
int x = Query(M);
M[ans.back()] = 1;
if (Query(M) == x) r = m;
else l = m+1;
}
ans.pb(rem[l]);
rem[l] = rem.back(),rem.pop_back();
}
for (i = 0; i < ans.size(); i++) ans[i]++;
Answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |