# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721753 | 2023-04-11T07:03:59 Z | MurotY | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include "art.h" #include<bits/stdc++.h> using namespace std; const int N=1e6+7, M=1e9+7; int a[N]; int l; vector <int> res; bool finn(int x, int y){ x--, y--; swap(res[x], res[y]); int r=publish(res); swap(res[x], res[y]); return l > r; } void solve(int n) { vector <int> a(n); for (int i=0;i<n;i++){ a[i]=i+1; res.push_back(i+1); } l=publish(res); stable_sort(a.begin(), a.end(), finn); answer(res); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |