# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1049213 | sofijavelkovska | Art Collections (BOI22_art) | C++17 | 902 ms | 1740 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 "art.h"
//#include "sample_grader.cpp"
#include <bits/stdc++.h>
using namespace std;
void solve(int n)
{
vector<int> a;
int inv[n+1];
for (int i=1; i<=n; i++)
{
a.clear();
for (int j=i; j<=n; j++)
a.push_back(j);
for (int j=1; j<i; j++)
a.push_back(j);
inv[i]=publish(a);
}
int order[n+1];
for (int i=1; i<=n; i++)
{
int weight;
if (i==n)
weight=inv[1]-inv[n];
else
weight=inv[i+1]-inv[i];
order[i]=(n-weight+1)/2;
}
vector<int> permutation(n);
for (int i=1; i<=n; i++)
permutation[order[i]-1]=i;
answer(permutation);
return;
}
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... |