# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1120266 | vjudge1 | Art Collections (BOI22_art) | C++17 | 1613 ms | 64060 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++) {
vector<int> a, b = {p[i]};
for(int j = 0; j < n; j++) {
if(i != j) {
b.push_back(p[j]);
}
a.push_back(p[j]);
}
int tx = ask(a), ty = ask(b);
int x = i - (tx - ty + i) / 2;
vector<int> nw;
for(int j = 0; j < x; j++) {
nw.push_back(p[j]);
}
nw.push_back(p[i]);
for(int j = x; 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... |