oj.uz

Submission #420496

# Submission time Handle Problem Language Result Execution time Memory
420496 2021-06-08T12:01:42 Z maximath_1 MalnaRISC (COI21_malnarisc) C++11
76.4122 / 100
 2 ms 332 KB 
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <set>
#include <string>
#include <vector>
#include <random>
#include <deque>
using namespace std;

mt19937 rng(420691273);
#define ll long long
const int MX = 1e5 + 5;

int main(){
	cin.tie(0) -> sync_with_stdio(0);

	int n; cin >> n;
	cout << n << endl;
	for(int i = 0; i < n; i ++){
		for(int j = i % 2; j + 1 < n; j += 2)
			cout << "CMPSWP R" << j + 1 << " R" << j + 2 << " ";
		cout << endl;
	}
	
	return 0;
}

Subtask #1
8.8333333333 / 10.0

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

Subtask #2
8.8333333333 / 10.0

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

Subtask #3
8.0555555556 / 10.0

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

Subtask #4
7.5111111111 / 10.0

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

Subtask #5
7.3209876543 / 10.0

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

Subtask #6
7.145631068 / 10.0

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

Subtask #7
7.298245614 / 10.0

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

Subtask #8
7.1893939394 / 10.0

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

Subtask #9
7.1342281879 / 10.0

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

Subtask #10
7.0903614458 / 10.0

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