# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685028 | oblantis | 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>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 2e9;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 12;
void solve(int n) {
vi out(n);
for(int i = 1; i <= n; i++) {
vi v;
for(int j = 1; j <= n; j++) {
if(i != j)v.pb(j);
}
v.pb(i);
int x = publish(v);
v.pop_back();
v = {i} + v;
int y = publish(v);
out[(y - x + (n - 1)) / 2] = i;
}
answer(out);
}