Submission #971488

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

swaps

#include "swaps.h"
#include <vector>
using namespace std;

void solve(int N, int V) {
	for (int i = 0; i < V; i++)
	{
		if (i % 2)
		{
			for (int j = 1; j <= N; j += 2)
			{
				schedule(j, j + 1);
			}
		}
		else
		{
			for (int j = 2; j <= N; j += 2)
			{
				schedule(j, j + 1);
			}
			schedule(1, N);
		}
		visit();
	}
	vector<int> v;
	for (int i = 0; i < N; i++)
	{
		v.push_back(i + 1);
	}
	answer(v);
}

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