# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843916 | 2023-09-04T16:57:43 Z | 42kangaroo | Art Collections (BOI22_art) | C++17 | 0 ms | 344 KB |
// // Created by 42kangaroo on 04/09/2023. // #include "bits/stdc++.h" #include "art.h" using namespace std; void solve(int n) { deque<int> o(n); std::iota(o.begin(), o.end(),1); vector<int> re(n); int first = publish(vector<int>(o.begin(), o.end())); o.push_back(o.front()); o.pop_front(); int last = first; for (int i = 1; i < n; ++i) { int tmp= publish(vector<int>(o.begin(), o.end())); re[i - 1] = last - tmp; last = tmp; } re.back() = last - first; vector<int> res(n); std::iota(res.begin(), res.end(),1); std::sort(res.begin(), res.end(), [&](int l, int r) {return re[l - 1] < re[r - 1];}); answer(res); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |