# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
538495 | safaricola | Library (JOI18_library) | C++17 | 259 ms | 304 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 <cstdio>
#include <vector>
using namespace std;
#include<bits/stdc++.h>
#include "library.h"
deque<int> ans;
void Solve(int N){
vector<int> M(N);
ans.push_back(0);
M[0] = 1;
for(int j=1; j<N; j++){
for(int i=0; i<N; i++){
if(M[i]!=1){
M[i]=1;
//for(int i=0; i<N; i++)cout<<M[i];
// cout<<endl;
if(Query(M)==1){
//cout<<"FOUND\n";
M[ans[0]]=0;
if(Query(M)==1){
M[ans[0]]=1;
ans.push_back(i);
}else{
M[ans[0]]=1;
ans.push_front(i);
}
i=N;
//for(auto it: ans) cout<<it<<" ";
// cout<<endl;
}else{
M[i]=0;
}
}
}
}
assert(ans.size()==N);
vector<int> res(N);
for(int i = 0; i < N; i++) {
res[i] = ans[i] + 1;
}
Answer(res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |