# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
882851 | AlphaMale06 | Art Collections (BOI22_art) | C++17 | 1141 ms | 2000 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){
vector<int> ans(n);
vector<int> p(n);
for(int i=0; i<n; i++)p[i]=i+1;
int qry[n];
for(int i=0; i< n; i++){
qry[i]=publish(p);
rotate(p.begin(), p.begin()+1, p.end());
}
for(int i=0; i< n; i++){
int x=qry[i];
int y=qry[(i+1)%n];
ans[(x-y+n-1)/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... |