# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
913842 | 2024-01-20T10:43:04 Z | Nonoze | Art Collections (BOI22_art) | C++17 | 1 ms | 344 KB |
#include "art.h" #include <bits/stdc++.h> using namespace std; void solve(int n) { vector<pair<int, int>> vec; vector<int> a(n); for (int i=0; i<n; i++) a[i]=i+1; vec.push_back({publish(a), 1}); int lst=vec.back().first; for (int i=1; i<n; i++) { vector<int> neww; for (int j=1; j<n; j++) neww.push_back(a[j]); neww.push_back(i); a=neww; lst=publish(a); vec.back().first-=lst; vec.push_back({lst, i+1}); } vec.back().first-=vec[0].first+vec[1].first; sort(vec.begin(), vec.end()); a.clear(); for (auto u: vec) a.push_back(u.second); answer(a); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 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 | 1 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 | 1 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 | 1 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 | 1 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 | 1 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |