# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727856 | 2023-04-21T13:25:01 Z | Charizard2021 | Art Collections (BOI22_art) | C++17 | 0 ms | 208 KB |
#include <bits/stdc++.h> #include "art.h" using namespace std; void solve(int n) { vector<int> val; for(int i = 0; i < n; i++) { vector<int> cur(n); for(int j = 0; j < n; j++){ cur[j] = (j + i) % n + 1; } val.push_back(publish(cur)); } vector<int> ans(n); for(int i = 0; i < n; ++i) { ans[(val[i] - val[(i + 1) % n] + n - 1) / 2] = i + 1; } answer(val); }
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 | - |