# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008372 | mispertion | Art Collections (BOI22_art) | C++17 | 966 ms | 2132 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 = {};
vector<int> ans(N, 0);
for(int i = 1; i <= N; i++)
v.push_back(i);
int pr = publish(v);
for(int i = 1; i < N; i++){
int tmp = v[0];
v.erase(v.begin());
v.push_back(tmp);
int nxt = publish(v);
int d = nxt - pr;
ans[(N - d) / 2] = i;
pr = nxt;
}
for(int i = 0; i < N; i++)
if(!ans[i])
ans[i] = N;
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... |