제출 #1003587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003587		pedroslrey	MalnaRISC (COI21_malnarisc)	C++17	40 / 100	1 ms	348 KiB

malnarisc

#include <bits/stdc++.h>

using namespace std;
using ops = vector<vector<pair<int, int>>>;

ops faz_morro(int n) {
	if (n == 0) return {};

	ops ans(1);
	int m = (1 << (n-1));
	for (int i = 0; i < m; ++i)
		ans.back().emplace_back(i, i + m);

	auto xss = faz_morro(n-1);
	for (auto &xs: xss) {
		ans.emplace_back();
		for (auto [a, b]: xs) {
			ans.back().emplace_back(a, b);
			ans.back().emplace_back(a + m, b + m);
		}
	}

	return ans;
}

ops solve(int n) {
	if (n == 0) return {};

	auto xss = solve(n-1);

	ops ans;
	for (auto &xs: xss) {
		ans.emplace_back();
		for (auto [a, b]: xs)
			ans.back().emplace_back(a, b);
		int m = 1 << (n-1);
		for (auto [a, b]: xs)
			ans.back().emplace_back(b + m, a + m);
	}

	auto yss = faz_morro(n);

	for (auto &ys: yss) {
		ans.emplace_back();
		for (auto y: ys)
			ans.back().push_back(y);
	}

	return ans;
}

int main() {
	int n;
	cin >> n;

	ops ans = solve(__lg(n));

	cout << ans.size() << "\n";
	for (auto &xs: ans) {
		for (auto [a, b]: xs)
			cout << "CMPSWP R" << a + 1 << " R" << b + 1 << " ";
		cout << "\n";
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 10 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10