Submission #653456

#	Time	Username	Problem	Language	Result	Execution time	Memory
653456		inksamurai	The Collection Game (BOI21_swaps)	C++17	0 / 100	1 ms	428 KiB

swaps

#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=N;
	print("a",n);
	vi usd(n);
	vi pns;
	rep(_,n){
		vi ert;
		rep(i,n){
			if(usd[i]) continue;
			ert.pb(i);
		}
		while(sz(ert)>1){
			vi nert;
			for(int i=0;i<sz(ert)-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;
		}
		usd[ert[0]]=1;
		pns.pb(ert[0]+1);
	}
	answer(pns);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 3
• Subtask 4: 0 / 2
• Subtask 5: 0 / 9
• Subtask 6: 0 / 6
• Subtask 7: 0 / 9
• Subtask 8: 0 / 6
• Subtask 9: 0 / 21
• Subtask 10: 0 / 14
• Subtask 11: 0 / 9
• Subtask 12: 0 / 6