# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251915 | tqbfjotld | On the Grid (FXCUP4_grid) | C++17 | 6 ms | 384 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 "grid.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int pos[1005]; ///position of size i
int ans[1005];
vector<int> confirmed;
int wrap(vector<int> v){
for (int x = confirmed.size()-1; x>=0; x--){
v.push_back(confirmed[x]);
}
vector<int> newv;
for (auto x : v){
newv.push_back(x-1);
}
int res = PutDisks(newv);
if (confirmed.size()==n-1) assert(res==n);
return res-confirmed.size();
}
vector<int> SortDisks(int N) {
n = N;
for (int x = N; x>=1; x--){
vector<int> qu;
vector<int> rem;
for (int y = 1; y<=N; y++){
if (ans[y]) continue;
rem.push_back(y);
}
for (int y : rem){
qu.clear();
qu.push_back(y);
for (int z : rem){
if (z!=y) qu.push_back(z);
}
if (wrap(qu)==x+x-1){
ans[y] = x;
confirmed.push_back(y);
//printf("%d at %d\n",x,y);
break;
}
}
}
vector<int> ans2;
for (int x = 1; x<=n; x++){
ans2.push_back(ans[x]);
//printf("push %d\n",ans[x]);
}
return ans2;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |