제출 #1150255

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150255		monkey133	MalnaRISC (COI21_malnarisc)	C++20	100 / 100	1 ms	328 KiB

malnarisc

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll n;
vector<pi> ans[1005];

void insert(ll x, ll y, ll idx)
{
	//show(idx);
	ans[idx].pb(mp(x,y));
}

ll merge(ll l, ll r, bool rev, ll idx)
{
	if (l >= r) return 0;
	ll bit = 1;
	while (bit * 2 < r-l + 1) bit*=2;
	for (ll i=l; i<=r - bit; ++i)
	{
		if (rev==0) insert(i , i + bit, idx);
		else insert(i + bit, i, idx);
	}
	return max(merge(l, l + bit-1, rev, idx + 1), merge(l + bit, r, rev, idx + 1)) + 1;
}

ll dnc(ll l = 0, ll r = n-1,  bool rev = 0, ll idx = 0)
{
	if (l >= r) return 0;
	ll siz = (r-l + 1);
	ll res = max(dnc(l, l + siz/2-1, !rev, idx), dnc(l + siz/2, r, rev, idx));
	res += merge(l, r, rev, idx + res);
	return res;
}

int main()
{
	cin >> n;
	ll res = dnc();
	cout << res << endl;
	for (ll i=0; i<res; ++i) 
	{
		assert(ans[i].size());
		for (pi u: ans[i])
		{
			cout << "CMPSWP R" << u.f +1 << " R" << u.s + 1 << ' ';
		}
		cout << endl;
	}
	return 0;
}

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