# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402066 | victoriad | Library (JOI18_library) | C++14 | 564 ms | 296 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>
#include "library.h"
using namespace std;
void Solve(int N)
{
vector<int>res;
if(N==1){
res.push_back(1);
}
else{
int primero;
vector<int>l(N,1);
for(int i=0;i<N;i++){
l[i]--;
if(Query(l)==1){
primero=i;
res.push_back(primero);
l[i]++;
break;
}
l[i]++;
}
vector<bool>c(N,false);
c[primero]=true;
while(res.size()<N){
vector<int>libres;
for(int i=0;i<N;i++){
if(!c[i]){
libres.push_back(i);
}
}
int low=0,hi=libres.size();
while(hi-low>1){
int mid=(hi+low)/2;
l.assign(N,0);
for(int i=0;i<mid;i++)l[libres[i]]++;
int v=Query(l);
l[res.back()]++;
if(v==Query(l)){
hi=mid;
}
else{
low=mid;
}
}
res.push_back(libres[low]);
c[libres[low]]=true;
}
for(int i=0;i<N;i++)res[i]++;
}
Answer(res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |