# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636391 | 2022-08-29T05:27:08 Z | Darren0724 | Art Collections (BOI22_art) | C++17 | 0 ms | 208 KB |
#include<bits/stdc++.h> using namespace std; int publish(vector<int>); void answer(vector<int>); void solve(int n){ vector<int> rec(n+2); for(int i=1;i<=n;i++){ vector<int> v; for(int j=i;j<=n;j++){ v.push_back(j); } for(int j=1;j<i;j++){ v.push_back(j); } rec[i]=publish(v); } vector<int> ans(n); for(int i=1;i<=n;i++){ int k=rec[i+1]-rec[i]; k=2*(n-1)-k; k/=2; k--; ans[k]=i; } answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |