# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867756 | Dec0Dedd | Art Collections (BOI22_art) | C++17 | 1255 ms | 1584 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"
using namespace std;
// n <= 4 000
// q <= 4 000
void solve(int n) {
vector<int> ans(n, 0);
for (int i=1; i<=n; ++i) {
vector<int> v;
for (int j=1; j<=n; ++j) v.push_back(j);
v.erase(v.begin()+i-1); v.insert(v.begin(), i);
int c1=publish(v);
v.erase(v.begin()), v.push_back(i);
int c2=publish(v);
// a = # of greater than i
// b = # of smaller than i
// a-b = c1-c2
// a+b = n-1
// a = (c1-c2+n-1)/2
assert((c1-c2+n-1)%2 == 0);
int b=(c1-c2+n-1)/2;
ans[b]=i;
}
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... |