제출 #854386

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

swaps

// #include <swaps.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'

void schedule(int, int);

vector<int> visit();

void answer(std::vector<int>);

vector<int> B;

void solve(int N, int V){
	for(int i = 1; i <= N; ++i) B.pb(i);
	for(int i = 0; i < 500; ++i){
		if(i&1){
			for(int j = 2; j < N; j += 2) schedule(B[j - 1], B[j]);
		}else{
			for(int j = 1; j < N; j += 2) schedule(B[j - 1], B[j]);
		}
		vector<int> vv = visit();
		if(i&1){
			for(int j = 2, k = 0; j < N; j += 2, ++k) if(!vv[k]) swap(B[j - 1], B[j]);
		}else{
			for(int j = 1, k = 0; j < N; j += 2, ++k) if(!vv[k]) swap(B[j - 1], B[j]);
		}
	}


	answer(B);
}

• 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