# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596222 | 2022-07-14T13:38:09 Z | Hacv16 | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include<bits/stdc++.h> #include<art.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int MAX = 4010; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; #define pb push_back #define sz(x) (int) x.size() #define fr first #define sc second #define mp make_pair #define all(x) x.begin(), x.end() #define dbg(x) cout << #x << ": " << "[ " << x << " ]\n" map<vector<int>, int> memo; int query(vector<int> v){ return publish(v); } void solve(int n){ vector<int> v(n), ans(n); iota(all(v), 1); int prev = query(v); for(int i = 2; i <= n; i++){ vector<int> aux; for(int j = i; j <= n; j++) aux.pb(j); for(int j = 1; j < i; j++) aux.pb(j); int cur = query(aux); ans[(n - 1 + prev - cur) >> 1] = i; prev = cur; } for(int i = 0; i < sz(ans); i++) if(ans[i] == 0) ans[i] = n; answer(ans); }
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 | - |