# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314149 | a_player | Library (JOI18_library) | C++14 | 0 ms | 0 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"
#include "grader.cpp"
using namespace std;
void Solve(int N)
{
if(N==1)Answer({1}),exit(0);
vector<vector<int> > a(N+1);
vector<int> M(N);
for(int i=1;i<=N;i++)
for(int j=1;j<i;j++){
M[i-1]=1;
M[j-1]=1;
int p=Query(M);
if(p==1){
a[i].push_back(j);
a[j].push_back(i);
}
M[i-1]=0;
M[j-1]=0;
}
int in=-1;
for(int i=1;i<=N;i++)if(a[i].size()==1)in=i;
vector<int> sol;
sol.push_back(in);
M[in-1]=1;
in=a[in][0];
while(a[in].size()!=1){
sol.push_back(in);
M[in-1]=1;
if(M[a[in][0]-1])in=a[in][1];
else in=a[in][0];
}
sol.push_back(in);
Answer(sol);
}