oj.uz

답안 #960784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960784 2024-04-11T03:42:32 Z ono_de206 MalnaRISC (COI21_malnarisc) C++14
4.53438 / 100
 2 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 = 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<vector<pair<int, int>>> ans;

	auto merge = [&](auto &self, int l, int r, int dir) {
		if(l == r) return;
		int m = (l + r) / 2;
		vector<pair<int, int>> ops;
		for(int i = l; i <= m; i++) {
			int j = m + (i - l) + 1;
			if(j > n) break;
			if(dir) ops.eb(i, j);
			else ops.eb(j, i);
		}
		ans.pb(ops);
		self(self, l, m, dir);
		self(self, m + 1, r, dir);
	};

	auto solve = [&](auto &self, int l, int r, int dir) {
		if(l == r) return;
		int m = (l + r) / 2;
		self(self, l, m, 1);
		self(self, m + 1, r, 0);
		merge(merge, l, r, dir);
	};
	solve(solve, 1, N, 1);
	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
1.4 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB Partially correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #3
1.0952380952 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct

Subtask #4
1.0289855072 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Partially correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #6
1.0101522843 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -