# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098862 | 2024-10-10T08:50:54 Z | epicci23 | Art Collections (BOI22_art) | C++17 | 0 ms | 344 KB |
#include "bits/stdc++.h" #include "art.h" //#define int long long #define all(v) v.begin() , v.end() #define sz(a) (int)a.size() using namespace std; void solve(int n){ vector<int> ans(n, -1); vector<int> cur; for(int j = 1; j <= n; j++) cur.push_back(j); int xd = publish(cur), agla = 0; for(int i = 1; i < n; i++){ vector<int> v; for(int j = 1; j <= i; j++) v.push_back(j); for(int j = n; j > i; j--) v.push_back(j); int hm = xd + publish(v); hm -= agla * 2; hm -= (n-i) * (n-1-i) / 2; hm /= 2; ans[hm]=i; for(int j=0;j<hm;j++) if(ans[j]==-1) agla++; } for(int i=0;i<n;i++){ if(ans[i]==-1){ ans[i]=n; break; } } answer(ans); } /*void _(){ } int32_t main(){ cin.tie(0); ios::sync_with_stdio(0); int tc=1;//cin >> tc; while(tc--) _(); return 0; }*/
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 | - |