oj.uz

Submission #960812

# Submission time Handle Problem Language Result Execution time Memory
960812 2024-04-11T04:54:09 Z ono_de206 MalnaRISC (COI21_malnarisc) C++14
92.2657 / 100
 1 ms 348 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 = 5e5 + 10, MXLOG = 22, mod = 1e9 + 7;
const long long inf = 1e18 + 10;

void go() {
	int n;
	cin >> n;
	vector<vector<pair<int, int>>> ans;
	for(int k = 2; (k >> 1) < n; k <<= 1) {
		vector<pair<int, int>> ops;
		for(int i = 0; i < n; i++) {
			int j = i ^ (k - 1);
			if(i < j && j < n) ops.eb(i + 1, j + 1);
		}
		ans.pb(ops);
		for(int j = k >> 1; j > 0; j >>= 1) {
			ops.clear();
			for(int i = 0; i < n; i++) {
				if(i < (i ^ j) && (i ^ j) < n) ops.eb(i + 1, (i ^ j) + 1); 
			}
			ans.pb(ops);
		}
	}
	cout << ans.size() << endl;
	for(auto ops : ans) {
		for(auto it : ops) {
			cout << "CMPSWP R" << it.ff << " R" << it.ss << ' ';
		}
		cout << endl;
	}
}

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

Subtask #1
7.6666666667 / 10.0

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

Subtask #2
8.25 / 10.0

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

Subtask #3
8.8333333333 / 10.0

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

Subtask #4
9.3777777778 / 10.0

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

Subtask #5
9.5679012346 / 10.0

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

Subtask #6
9.6601941748 / 10.0

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

Subtask #7
9.6315789474 / 10.0

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

Subtask #8
9.6818181818 / 10.0

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

Subtask #9
9.7651006711 / 10.0

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

Subtask #10
9.8313253012 / 10.0

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