# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596202 | Hacv16 | Art Collections (BOI22_art) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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){
if(memo.find(v) != memo.end())
return memo[v];
return memo[v] = publish(v);
}
void solve(int N){
vector<int> v(n), ans(n);
iota(all(v), 1);
for(int i = 1; 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 x = query(aux);
aux.clear();
for(int j = i + 1; j <= n; j++)
aux.pb(j);
for(int j = 1; j <= i; j++)
aux.pb(j);
int y = query(aux);
int a = (n - 1 + x - y) >> 1;
ans(a + 1) = i;
}
answer(ans);
}