# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714316 | vjudge1 | Art Collections (BOI22_art) | C++17 | 0 ms | 0 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;
int n;
bool comp(int a, int b){
vector<int> v = {a, b};
for (int i = 1; i <= n; i++)
{
if(a == i || b == i) continue;
v.emplace_back(i);
}
int p1 = publish(v);
swap(v[0], v[1]);
int p2 = publish(v);
return p1 < p2;
}
void rec(int l, int r, vector<int>& v){
if(l == r) return;
int mid = (l + r) / 2;
rec(l, mid, v);
rec(mid + 1, r, v);
vector<int> v1, v2;
for (int i = l; i <= mid; i++)
{
v1.emplace_back(v[i]);
}
for (int i = mid + 1; i <= r; i++)
{
v2.emplace_back(v[i]);
}
int j = l;
int p1 = l, p2 = mid + 1;
while(p1 <= mid && p2 <= r){
if(comp(v1[p1 - l], v2[p2 - mid - 1])){
v[j++] = v1[p1 - l];
p1++;
}
else{
v[j++] = v2[p2 - mid - 1];
p2++;
}
i++;
}
while(p1 <= mid){
v[j++] = v1[(p1 - l)];
p1++;
}
while(p2 <= r){
v[j++] = v2[p2 - mid - 1];
p2++;
}
}
void solve(int N){
n = N;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
v[i] = i + 1;
}
rec(0, n - 1, v);
answer(v);
}