Submission #429719

#	Time	Username	Problem	Language	Result	Execution time	Memory
429719		mosiashvililuka	The Collection Game (BOI21_swaps)	C++14	25 / 100	119 ms	440 KiB

swaps

#include "swaps.h"
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,V,bo[5009],p[5009],pi,q[5009],qi;
vector <int> vv,ans;
void solve(int N, int VV) {
	a=N;V=VV;
	for(ii=1; ii<a; ii++){
		pi=0;
		for(i=1; i<=a; i++){
			if(bo[i]==1) continue;
			pi++;p[pi]=i;
		}
		while(pi!=1){
			for(i=1; i<pi; i+=2){
				schedule(p[i],p[i+1]);
			}
			vv=visit();
			qi=0;
			j=-1;
			for(i=1; i<pi; i+=2){
				j++;
				if(vv[j]==1){
					qi++;q[qi]=p[i];
				}else{
					qi++;q[qi]=p[i+1];
				}
			}
			if(pi%2==1){
				qi++;q[qi]=p[pi];
			}
			pi=qi;
			for(i=1; i<=pi; i++){
				p[i]=q[i];
			}
		}
		ans.push_back(p[1]);
		bo[p[1]]=1;
	}
	for(i=1; i<=a; i++){
		if(bo[i]==0){
			ans.push_back(i);break;
		}
	}
	answer(ans);
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 3 / 3
• Subtask 4: 2 / 2
• Subtask 5: 9 / 9
• Subtask 6: 6 / 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