# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602461 | shrimb | 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 "art.h"
#include"bits/stdc++.h"
using namespace std;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
// art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
int n;
bool cmp ( int a, int b) {
vector<int> x;
for (int i = 1 ; i <= n ; i++) {
if (i != a and i != b) x.push_back(i);
}
auto y = x;
x.push_back(a);
x.push_back(b);
y.push_back(b);
y.push_back(a);
return publish(x) < publish(y);
}
void solve(int N) {
vector<int> order(N);
n = N;
for (int i = 0 ; i < N ; i++) order[i] = i + 1;
if (N < 100) {
sort(order.begin(), order.end(), cmp);
answer(order);
return 0;
}
random_shuffle(order.begin(), order.end());
vector<pair<int,int>> v;
for (int i = 1 ; i <= N ; i++) {
auto tmp = order;
tmp.erase(find(tmp.begin(), tmp.end(), i));
tmp.push_back(i);
v.emplace_back(publish(tmp), i);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
vector<int> ans;
for (auto [i, j] : v) ans.push_back(j);
answer(ans);
}