Submission #150613

#TimeUsernameProblemLanguageResultExecution timeMemory
1506131 WA = 5 Push Up (#200)On the Grid (FXCUP4_grid)C++17
12 / 100
7 ms344 KiB
// N <= 50 #include <algorithm> #include <vector> #include "grid.h" std::vector<int> SortDisks(int N) { std::vector<int> tmp(N); std::vector<int> ans(N); for (int i = 0; i < N; ++i) tmp[i] = i; for (int t = N - 1; t >= 1; --t) { int maxlen = -1; int maxt = -1; for (int i = 0; i <= t; ++i) { std::swap(tmp[0], tmp[i]); const int len = PutDisks(tmp); std::swap(tmp[0], tmp[i]); if (len > maxlen) { maxlen = len; maxt = i; } } std::swap(tmp[t], tmp[maxt]); } for (int i = 0; i < N; ++i) ans[tmp[i]] = i + 1; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...