# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714345 | vjudge1 | Art Collections (BOI22_art) | C++17 | 0 ms | 208 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"
#define ll long long
#define pii pair<int, int>
using namespace std;
void solve(int N){
int n = N;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
v[i] = i + 1;
}
int a = publish(v);
vector<int> ans(n);
for (int i = 1; i < n; i++)
{
v.erase(v.begin() + (i - 1));
v.insert(v.begin(), i);
int p1 = publish(v);
v.erase(v.begin());
v.push_back(i);
int p2 = publish(v);
v.pop_back();
v.insert(v.begin() + (i - 1), i);
int pos = n - (n - 1 + abs(a - p1) + abs(a - p2)) / 2;
ans[pos - 1] = i;
}
for (int i = 0; i < n; i++)
{
if(ans[i] == 0){
ans[i] = n;
break;
}
}
reverse(ans.begin(), ans.end());
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... |