# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924008 | berr | Art Collections (BOI22_art) | C++17 | 1270 ms | 1720 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), val(n), pos(n);
for(int i=0; i<n; i++){
vector<int> b(n);
for(int l=i; l<i+n; l++){
b[l-i]=l%n; b[l-i]++;
}
val[i] = publish(b);
}
for(int i=0; i<n; i++){
ans[(val[i]-val[(i+1)%n]+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... |