Submission #1212825

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212825		lance0	The Collection Game (BOI21_swaps)	C++20	50 / 100	21 ms	420 KiB

swaps

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

void solve(int N, int V) {
	vector<int> ans;
	for (int i = 1; i <= N; i++) {
		ans.push_back(i);
	}
	for (int i = 0; i < 500; i++) {
		int j;
		if (i % 2) {
			j = 2;
		} else {
			j = 1;
		}
		for (int k = j; k < N; k+=2) {
			schedule(ans[k-1], ans[k]);
		}
		vector<int> res = visit();
		for (int k = 0; k < res.size(); k++) {\
			//the corresponding indices are j-1+2*k, j+2*k
			if (res[k] == 0) {
				swap(ans[j-1+2*k],ans[j+2*k]);
			}
		}
	}
	answer(ans);
}

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