Submission #1295140

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295140		farica	The Collection Game (BOI21_swaps)	C++20	0 / 100	1 ms	332 KiB

swaps

#include <bits/stdc++.h>
#include "swaps.h"
using namespace std;
using vi = vector<int>;
using pi = pair<int,int>;

void recSort(int n, vi &v) {
	if(n == 1) return;
	if(n == 2) {
		schedule(v[0], v[1]);
		vi tmp = visit();
		return;
	} 
	vi a, b;
	for(int i=0; i<n; i+=2) {
		if(i+1<n) schedule(v[i], v[i+1]);
		a.push_back(v[i]);
		if(i+1<n) b.push_back(v[i+1]);
	}
	vi tmp = visit();
	recSort((int)a.size(), a);
	recSort((int)b.size(), b);
	for(int i=1; i<n-1; i+=2) {
		schedule(v[i], v[i+1]);
	}
	tmp = visit();
	for(int i=0; i<n-1; i+=2) {
		schedule(v[i], v[i+1]);
	}
	tmp = visit();
}

void solve(int N, int V) {
    vi v;
    for(int i=1; i<=N; ++i) v.push_back(i);
    recSort(N, v);
    reverse(v.begin(), v.end());
    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