# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590101 | 2022-07-05T14:16:18 Z | fabijan_cikac | Art Collections (BOI22_art) | C++17 | 0 ms | 208 KB |
#include <bits/stdc++.h> using namespace std; #include "art.h" const int MAXN = 4010; int l[MAXN]; int bio[MAXN] = { 0 }; void solve(int N){ vector<int> sol; vector<int> v; for (int i = 1; i <= N; ++i) v.push_back(i); for (int i = 0; i < N; ++i){ l[i] = publish(v); reverse(v.begin(), v.end()); v.pop_back(); v.push_back(i + 2); } for (int i = 0; i < N; ++i){ int x = 0; while (l[x] - l[x - 1] != N - i - 1) ++x; sol.push_back(x + 1); int kx = (x - 1 + N) % N; int cnt = 1; while (kx != x){ l[kx] -= cnt; ++cnt; kx = (kx - 1 + N) % N; } } answer(sol); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |