Submission #971485

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

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <vector>
using namespace std;

int color[100000];

void solve(int N, int V) {
	for (int i = 1; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			color[j] = 0;
		}
		for (int j = 0; j < N; j++)
		{
			if (color[j] == 0)
			{
			schedule(j + 1, (j + i) % N + 1);
			color[(j + i) % N] = 1;
			}
		}
		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