# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828613 | 2023-08-17T12:46:45 Z | Pacybwoah | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include<iostream> #include<vector> #include<algorithm> #include"art.h" using namespace std; void solve(int N){ vector<int> vec(N),ans(N); for(int i=0;i<N;i++) vec[i]=i+1; int old=publish(vec); for(int i=1;i<N;i++){ for(int j=0;j<N;j++) vec[(j-i+N)%N]=j+1; int unold=publish(vec); ans[(old-unold+N-1)/2]=i; } for(int i=0;i<N;i++) if(ans[i]==0) ans[i]=N; answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |