# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600109 | TimDee | Art Collections (BOI22_art) | C++17 | 1611 ms | 712 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;
using ll = long long;
void solve (int n) {
deque<int> a;
for (int i=1; i<=n; ++i) a.push_back(i);
vector<int> b(a.begin(), a.end());
int x=publish(b);
vector<int> ans(n,n);
for (int i=1; i<n; ++i) {
a.pop_front();
a.push_back(i);
vector<int> b(a.begin(), a.end());
int y=publish(b);
int z=y-x;
x=y;
int ind=(n-1-z)/2; //cout<<x<<' '<<y<<' '<<ind<<'\n';
ans[ind]=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... |