# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653454 | inksamurai | The Collection Game (BOI21_swaps) | 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>
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 _3D2ZDxo 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 "swaps.h"
void solve(int N, int V){
int n=V;
vi ert;
rep(i,n){
ert.pb(i);
}
vi pns;
rep(_,n){
while(sz(ert)>1){
vi nert;
for(int i=0;i<n-1;i+=2){
schedule(ert[i]+1,ert[i+1]+1);
}
vi res=visit();
if(sz(ert)%2){
nert.pb(ert.back());
ert.pop_back();
}
for(int i=0;i<sz(ert);i+=2){
if(res[i/2]){
nert.pb(ert[i]);
}else{
nert.pb(ert[i+1]);
}
}
ert=nert;
}
pns.pb(ert[0]+1);
}
answer(pns);
}
signed main(){
_3D2ZDxo;
}