제출 #971527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
971527		CyberCow	The Collection Game (BOI21_swaps)	C++17	50 / 100	311 ms	1884 KiB

swaps

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

int arj[505];

void solve(int N, int V) {
	
	for (int i = 1; i <= N; i++)
	{
		arj[i] = i;
	}
	for (int i = 0; i < V; i++)
	{
		if (i % 2)
		{
			for (int j = 1; j < N; j += 2)
			{
				schedule(arj[j], arj[j + 1]);
			}
		}
		else
		{
			for (int j = 2; j < N; j += 2)
			{
				schedule(arj[j], arj[j + 1]);
			}
			schedule(arj[1], arj[N]);
		}
		vector<int> visa = visit();
		if (i % 2)
		{
			for (int j = 1; j < N; j += 2)
			{
				if (visa[j / 2] == 0)
				{
					swap(arj[j], arj[j + 1]);
				}
			}
		}
		else
		{
			for (int j = 2; j < N; j += 2)
			{
				if (visa[j / 2 - 1] == 0)
				{
					swap(arj[j], arj[j + 1]);
				}
			}
			if (visa.back() == 0)
			{
				swap(arj[1], arj[N]);
			}
		}
	}
	vector<int> v;
	for (int i = 1; i <= N; i++)
	{
		v.push_back(arj[i]);
	}
	answer(v);
}

• 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