# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597775 | 2022-07-16T21:00:26 Z | yanndev | Art Collections (BOI22_art) | C++17 | 0 ms | 208 KB |
#include <art.h> #include <bits/stdc++.h> using namespace std; void solve(int n) { vector<int> posOfVal(n, -1); // newInv = oldInv - (rank - 1) + (n - rank) // (newInv - oldInv - () for (int i = 1; i <= n; i++) { vector<int> ls {}; ls.push_back(i); for (int j = 1; j <= n; j++) if (j != i) ls.push_back(j); int oldInv = publish(ls); ls.clear(); for (int j = 1; j <= n; j++) if (j != i) ls.push_back(j); ls.push_back(i); // curInv = oldInv int curInv = publish(ls); // curInv = oldInv - (rank - 1) + (n - rank) // curInv = oldInv - (2 * rank) + (n + 1) // -(curInv - oldInv - (n + 1))/2 = rank posOfVal[i] = -(curInv - oldInv - (n + 1)) / 2; } vector<int> ls (n, -1); for (int i = 1; i <= n; i++) ls[posOfVal[i]] = i; answer(ls); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |