# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685046 | oblantis | Art Collections (BOI22_art) | C++17 | 1606 ms | 696 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 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;
int publish(vi v);
void answer(vi v);
void solve(int n) {
vi out;
int x, y = inf;
for(int i = n; i >= 1; i--) {
vi t;
for(int j = 1; j < i; j++) {
if(i != j)t.pb(j);
}
for(int j = 0; i + j < n; j++)t.pb(out[j]);
t.pb(i);
x = publish(t);
if(i == n)out.pb(i), y = x;
else {
int z = (y - x + (n - i)) / 2;
out.insert(out.begin() + z, i);
y -= z;
}
}
answer(out);
}
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... |