# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
902461 | 12345678 | Art Collections (BOI22_art) | C++17 | 1223 ms | 1524 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 <bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> v(N), res(N+1), ans(N);
for (int i=1; i<=N; i++)
{
v[0]=i;
for (int j=1; j<N; j++) v[j]=v[j-1]+1>N?v[j-1]+1-N:v[j-1]+1;
res[i]=publish(v);
}
for (int i=1; i<=N; i++)
{
int tmp=res[i]-res[(i+1)>N?i+1-N:i+1], loc=(tmp+N-1)/2;
ans[loc]=i;
}
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... |