oj.uz

Submission #960772

# Submission time Handle Problem Language Result Execution time Memory
960772 2024-04-11T03:23:11 Z ono_de206 MalnaRISC (COI21_malnarisc) C++14
10.3628 / 100
 4 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181;// D = 1523, N = 2500;
const long long inf = 2e18 + 10;

void go() {
	int n;
	cin >> n;
	int N = 1;
	while(N < n) N <<= 1;
	vector<pair<int, int>> ops;
	auto solve = [&](auto &self, int l, int r) {
		if(l == r) return;
		int m = (l + r) / 2;
		self(self, l, m);
		self(self, m + 1, r);
		for(int i = l; i <= m; i++) {
			for(int j = m + 1 + (i - l); j >= m + 1; j--) {
				if(j <= n) ops.eb(i, j);
			}
		}
	};
	solve(solve, 1, N);
	// vector<vector<pair<int, int>>> ans;
	cout << ops.size() << endl;
	for(auto it : ops) {
		cout << "CMPSWP R" << it.ff << " R" << it.ss << endl;
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
1.25 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Partially correct

Subtask #2
1.0540540541 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Partially correct

Subtask #3
1.0416666667 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Partially correct

Subtask #4
1.0087719298 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Partially correct

Subtask #5
1.00249066 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 344 KB Partially correct

Subtask #6
1.0020408163 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 348 KB Partially correct

Subtask #7
1.0013071895 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 344 KB Partially correct

Subtask #8
1.0009751341 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 348 KB Partially correct

Subtask #9
1.0007861635 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 604 KB Partially correct

Subtask #10
1.000667334 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 600 KB Partially correct