# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
656586 | haojiandan | Library (JOI18_library) | C++14 | 443 ms | 312 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>
#include "library.h"
using namespace std;
int n,p[1010],tot;
int d[1010],vis[1010];
void Solve(int _n) {
n=_n;
if (n==1) { Answer({1}); return; }
int x=-1;
for (int i=1;i<=n;i++) {
vector<int> Q(n);
for (int j=1;j<=n;j++) Q[j-1]=1;
Q[i-1]=0;
if (Query(Q)==1) { x=i; break; }
}
d[1]=x,vis[x]=1;
for (int i=2;i<=n;i++) {
tot=0;
for (int j=1;j<=n;j++) if (!vis[j]) p[++tot]=j;
if (tot==1) { d[i]=p[1]; continue; }
int l=1,r=tot,mid,res=-1;
while (l<=r) {
vector<int> Q(n);
for (int j=1;j<=n;j++) Q[j-1]=0;
int mid=(l+r)>>1;
for (int j=1;j<=mid;j++) Q[p[j]-1]=1;
int tmp=Query(Q);
Q[d[i-1]-1]=1;
tmp=abs(tmp-Query(Q));
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |