| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 651632 | inksamurai | 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>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3CZAtRo ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
#include "art.h"
void solve(int N){
int n=N;
vi pns(n);
rep(pvt,n){
vi a;
a.pb(pvt+1);
rep(j,n){
if(j==pvt) continue;
a.pb(j+1);
}
int u=publish(a);
a.erase(a.begin());
a.pb(pvt+1);
int v=publish(a);
assert((u+v-n+1)%2==0);
int z=(u+v-n+1)/2;
int x=u-z;
pns[x]=pvt+1;
}
answer(pns);
}