Submission #403617

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

swaps

#include<bits/stdc++.h>
#include "swaps.h"
using namespace std;

int a[505];

void solve(int N, int V){
	for(int i = 0; i < N; i ++) a[i] = i+1;
    int po2 = 1;
    while(po2 < N) po2 *= 2;
	for(int k = 2; k <= po2; k *= 2){
		for(int j = k/2; j >= 1; j/= 2){
			for(int i = 0; i < N; i ++){
				int l = (i^j);
				if(l > i){
					if((i&k) == 0){
						if(a[l] > N) continue;
						if(a[i] > N) swap(a[i],a[l]);
						schedule(a[i],a[l]);
					}
					else{
						if(a[i] > N) continue;
						if(a[l] > N) swap(a[i],a[l]);
						schedule(a[l],a[i]);
					}
				}
			}
			vector<int> gg = visit();
			int cur = 0;
			for(int i = 0; i < N; i ++){
				int l = (i^j);
				if(l > i){
					if(a[i] > N or a[l] > N) continue;
					if(gg[cur] != 1) swap(a[i],a[l]);
					cur++;
				}
			}
		}
	}
	vector<int> ans;
	for(int i = 0; i < N; i ++){
		ans.push_back(a[i]);
		assert(a[i] <= N);
	}
	answer(ans);
}

• 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