제출 #1159972

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

malnarisc

#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}
size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
//#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#endif
typedef long long ll;
#define pi pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
void solve() {
	//ifstream cin("nazwa.in");
	//ofstream cout("nazwa.out");
	auto ask = [&](int a, int b) {
		cout << "CMPSWP R" << a << " R" << b << ' ';
	};
	int n;
	cin >> n;
	cout << n * (n - 1) / 2 << '\n';
	for(int i = 1; i <= n; i++) {
		for(int j = i + 1; j <= n; j++) {
			ask(i, j);
			cout << '\n';
		}
	}
}
int main() {
	fastio();
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}

• Subtask 1: 1.125 / 10
• Subtask 2: 1.0357 / 10
• Subtask 3: 1.0217 / 10
• Subtask 4: 1.0046 / 10
• Subtask 5: 1.0016 / 10
• Subtask 6: 1.0011 / 10
• Subtask 7: 1.0008 / 10
• Subtask 8: 1.0006 / 10
• Subtask 9: 1.0005 / 10
• Subtask 10: 1.0004 / 10