# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849259 | vjudge1 | Art Collections (BOI22_art) | C++17 | 90 ms | 1472 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 n, pos[mxN];
bool les[mxN][mxN];
void fix(int a, int b) {
les[a][b] = true;
for (int c = 1; c <= n; ++c) {
if (les[b][c] && !les[a][c]) {
fix(a, c);
}
}
}
void solve(int N) {
n = 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) {
int a = check[i], b = check[i + 1];
if (!les[a][b] && !les[b][a]) {
swap(check[i], check[i + 1]);
int nex = publish(check);
if (nex < cur) {
cur = nex;
/*
for (auto x : check) {
cout << x << ' ';
}
cout << "\n";
*/
fix(b, a);
}
else {
fix(a, b);
swap(check[i], check[i + 1]);
}
}
else if (les[b][a]) {
/*
for (auto x : check) {
cout << x << ' ';
}
cout << "\n";
*/
swap(check[i + 1], check[i]);
--cur;
}
}
}
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... |