# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
150151 | | Powered By Zigui (#200) | On the Grid (FXCUP4_grid) | C++17 | | 11 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;
std::vector<int> SortDisks(int N) {
vector<int> correct;
vector<int> ans; ans.resize(N);
set<int> S;
for(int i = 0 ; i < N ; i++) S.insert(i);
for(int i = 0 ; i < N ; i++){
for(auto val1 : S) {
vector<int> tmp;
tmp.push_back(val1);
for(auto val2 : S) if(val1 != val2) tmp.push_back(val2);
for(int j = correct.size() - 1 ; j >= 0 ; j--) tmp.push_back(correct[j]);
int X = PutDisks(tmp);
//cout << X << '\n';
if(X == 2 * N - 1 - i) {
ans[val1] = N - i;
correct.push_back(val1);
S.erase(val1);
break;
}
}
}
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... |