oj.uz

Submission #1116236

# Submission time Handle Problem Language Result Execution time Memory
1116236 2024-11-21T11:20:56 Z NotLinux MalnaRISC (COI21_malnarisc) C++17
20 / 100
 2 ms 592 KB 
// Author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
void solve(){
	int n;
	cin >> n;
	cout << 2 * (n-1) << endl;
	for(int i = 1;i<n;i++){
		for(int j = 1;j<n;j+=2){
			cout << "CMPSWP R" << j << " R" << j+1 << " ";
			if(j+2 >= n)cout << endl;
		}
		for(int j = 2;j<n;j+=2){
			cout << "CMPSWP R" << j << " R" << j+1 << " ";
			if(j+2 >= n)cout << endl;
		}
	}
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
	cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl;
}

Subtask #1
2.0 / 10.0

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

Subtask #2
2.0 / 10.0

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

Subtask #3
2.0 / 10.0

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

Subtask #4
2.0 / 10.0

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

Subtask #5
2.0 / 10.0

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

Subtask #6
2.0 / 10.0

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

Subtask #7
2.0 / 10.0

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

Subtask #8
2.0 / 10.0

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

Subtask #9
2.0 / 10.0

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

Subtask #10
2.0 / 10.0

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