# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1120243 | vjudge1 | Art Collections (BOI22_art) | C++17 | 248 ms | 7796 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;
typedef long long ll;
map<vector<int>, int> u;
int cnt, n;
int ask(vector<int> v) {
if(u.count(v)) {
return u[v];
}
return u[v] = publish(v);
}
void solve(int N) {
n = N;
vector<int> p(n);
for(int i = 0; i < n; i++) {
p[i] = i + 1;
}
for(int i = 1; i < n; i++) {
int pos = i;
for(int l = 0, r = i - 1; l <= r;) {
int mid = l + r >> 1;
vector<int> t, d;
for(int j = 0; j < mid; j++) {
t.push_back(p[j]);
d.push_back(p[j]);
}
t.push_back(p[i]);
d.push_back(p[mid]);
t.push_back(p[mid]);
d.push_back(p[i]);
for(int j = mid + 1; j < n; j++) {
if(j != i) t.push_back(p[j]);
if(j != i) d.push_back(p[j]);
}
if(ask(t) < ask(d)) {
pos = mid;
r = mid - 1;
}
else l = mid + 1;
}
vector<int> nw;
for(int j = 0; j < pos; j++) {
nw.push_back(p[j]);
}
nw.push_back(p[i]);
for(int j = pos; j < n; j++) {
if(j != i) nw.push_back(p[j]);
}
nw.swap(p);
}
answer(p);
}
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... |