# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
864131 | vnm06 | Art Collections (BOI22_art) | C++17 | 1373 ms | 1988 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>
#include "art.h"
using namespace std;
int ans[4005];
vector<int> res;
void solve(int N)
{
res.resize(N);
vector<int> order;
order.resize(N);
for(int i=1; i<=N; i++)
{
for(int j=i;;)
{
order[(j-i+N)%N]=j;
j++;
if(j>N) j=1;
if(j==i) break;
}
ans[i]=publish(order);
}
for(int i=1; i<=N; i++)
{
int be=ans[i], en=ans[i+1];
if(i==N) en=ans[1];
///cout<<be<<" "<<en<<endl;
if(N&1) res[N/2-(en-be)/2]=i;
else res[(N-1)/2-(en-be+1)/2+1]=i;
}
answer(res);
}
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... |