# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
150063 | | Ian and 2-bit memory (#200) | On the Grid (FXCUP4_grid) | C++17 | | 5 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 <bits/stdc++.h>
using namespace std;
#include "grid.h"
vector<int> SortDisks(int N) {
vector<int> ans(N), inv(N);
set<int> left;
for (int i = 0; i < N; i++)
left.insert(i);
for (int i = N - 1; i >= 0; i--) {
vector<int> test(inv);
auto it = left.begin();
for (int j = 0; j <= i; j++, it++)
test[j] = *it;
// for (int j : test) printf("%d ", j); puts("");
int tmp = PutDisks(test) - N;
tmp = test[i - tmp];
// printf("i=%d tmp=%d\n", i, tmp);
left.erase(tmp);
ans[tmp] = i + 1;
inv[i] = tmp;
}
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... |