# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849214 | vjudge1 | Art Collections (BOI22_art) | C++17 | 84 ms | 2756 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;
const int mxN = 4007;
int pos[mxN];
bool done[mxN][mxN];
void solve(int n) {
vector<int> check;
for (int i = 1; i <= n; ++i) {
check.push_back(i);
pos[i] = i - 1;
}
int cur = publish(check);
while (cur) {
for (int i = 0; i < n - 1 && cur; ++i) {
if (!done[check[i]][check[i + 1]]) {
swap(check[i], check[i + 1]);
int nex = publish(check);
if (nex < cur) {
cur = nex;
}
else {
swap(check[i], check[i + 1]);
}
done[check[i]][check[i + 1]] = done[check[i + 1]][check[i]] = true;
}
}
}
/*
for (int i = 1; i <= n && cur; ++i) {
for (int j = i + 1; j <= n && cur; ++j) {
swap(check[pos[i]], check[pos[j]]);
int nex = publish(check);
if (nex < cur) {
cout << i << ' ' << j << "\n";
for (auto x : check) {
cout << x << ' ';
}
cout << "\n";
swap(pos[i], pos[j]);
cur = nex;
}
else {
swap(check[pos[i]], check[pos[j]]);
}
}
}
*/
answer(check);
}
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... |