# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849257 | 2023-09-14T10:11:21 Z | vjudge1 | Art Collections (BOI22_art) | C++17 | 1 ms | 344 KB |
#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; fix(a, b); } else { fix(b, a); swap(check[i], check[i + 1]); } } else if (les[b][a]) { swap(check[i + 1], check[i]); --cur; } } } answer(check); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |