# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080354 | nathan4690 | Library (JOI18_library) | C++14 | 416 ms | 344 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;
void Solve(int N)
{
vector<int> M(N);
vector<int> res(N);
vector<int> rem(N);
if(N <= 2){
for(int i=0;i<N;i++) res[i] = i+1;
Answer(res);
return;
}
for(int i=0;i<N;i++) M[i] = 1;
for(int i=0;i<N;i++){
M[i] = 0;
int A = Query(M);
if(A == 1){
res[0] = i+1;
break;
}
M[i] = 1;
}
for(int i=0;i<N;i++) rem[i] = i+1;
rem.erase(lower_bound(rem.begin(), rem.end(), res[0]));
for(int i=1;i<N;i++){
int L = 0, R = rem.size()-1;
while(L <= R){
int mid = (L + R) / 2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |