# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849803 | Ahmed57 | Art Collections (BOI22_art) | C++17 | 0 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |