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 "grid.h"
#include <bits/stdc++.h>
using namespace std;
bool use[1005];
deque<int> dq;
set<pair<int,int>> done;
int ask(){
vector<int> v;
for(int i:dq)v.push_back(i);
for(auto it:done)v.push_back(it.second);
return PutDisks(v);
}
vector<int> SortDisks(int N){
for(int i=0;i<N;++i)dq.push_back(i);
vector<int> ans(N);
int pv=ask();
while(!dq.empty()){
if(dq.size()==1){
for(int i=1;i<=N;++i){
if(!use[i])ans[dq[0]]=i;
}
break;
}
while(true){
int x=dq.back();
dq.pop_back();
dq.push_front(x);
int cur=ask();
if(cur>=pv){
int res=cur-N+1;
use[res]=true;
ans[dq.front()]=res;
done.insert({res,dq.front()});
dq.pop_front();
break;
}
pv=cur;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |