Submission #436137

#TimeUsernameProblemLanguageResultExecution timeMemory
436137AmineTrabelsiLibrary (JOI18_library)C++14
19 / 100
563 ms288 KiB
#include <cstdio> #include <bits/stdc++.h> #include "library.h" using namespace std; void Solve(int N){ vector<int> M(N); vector<int> res(N); deque<int> curr; curr.push_back(1); M[0] = 1; for(int i=1;i<N;i++){ M[i] = 1; int q = Query(M); if(q == 1){ curr.push_back(i+1); break; } M[i] = 0; } for(int t=2;t<N;t++){ for(int i=1;i<N;i++){ if(M[i] != 1){ M[i] = 1; int q = Query(M); if(q == 1){ M[curr.back()-1] = 0; q = Query(M); M[curr.back()-1] = 1; if(q == 2){ curr.push_back(i+1); }else{ curr.push_front(i+1); } break; } M[i] = 0; } } } for(auto i:curr)cerr<<i<<"\n"; res = vector<int>(curr.begin(),curr.end()); Answer(res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...