# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849803 | 2023-09-15T11:45:14 Z | Ahmed57 | Art Collections (BOI22_art) | C++17 | 0 ms | 344 KB |
#include <bits/stdc++.h> using namespace std; #include "art.h" void solve(int N){ deque<int> x; int lol[N] = {0}; for(int i = 1;i<=N;i++){ x.push_back(i); vector<int> xd; for(auto j:x){ xd.push_back(j); } lol[i-1] = publish(xd); x.pop_front(); x.push_back(i); } vector<int> ans(N,0); for(int i = 0;i<N;i++){ int diff = lol[i]-lol[(i+1)%N]; ans[(N-1+diff)/2] = (i+1); } answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |