# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711492 | 2023-03-17T05:49:58 Z | becaido | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include <bits/stdc++.h> #include "art.h" using namespace std; void solve(int N) { vector<int> v(N), ans(N); iota(v.begin(), v.end(), 1); int last = publish(v); for (int i = 1; i < N; i++) { v.insert(v.begin(), v.back()); v.pop_back(); int cur = publish(v), delta = cur - last, rk = (delta + N + 1) / 2; ans[rk - 1] = N - i + 1; } for (int &x : ans) if (!x) x = 1; answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |