oj.uz

Submission #559974

# Submission time Handle Problem Language Result Execution time Memory
559974 2022-05-11T01:52:26 Z Yazan_Alattar MalnaRISC (COI21_malnarisc) C++14
76.5753 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 100007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

int n;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;

    int to = n;
//    if(n == 8) to = 7;
//    else if(n == 13) to = 10;
//    else if(n == 16) to = 10;
//    else if(n == 32) to = 15;
//    else if(n == 53) to = 21;
    if(n == 64) to = n - 1;
//    else if(n == 73) to = 28;
    else if(n == 82) to = n - 1;
//    else if(n == 91) to = 29;
    else if(n == 100) to = n - 1;

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

Subtask #1
8.8333333333 / 10.0

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

Subtask #2
8.8333333333 / 10.0

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

Subtask #3
8.0555555556 / 10.0

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

Subtask #4
7.5111111111 / 10.0

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

Subtask #5
7.3209876543 / 10.0

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

Subtask #6
7.213592233 / 10.0

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

Subtask #7
7.298245614 / 10.0

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

Subtask #8
7.2424242424 / 10.0

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

Subtask #9
7.1342281879 / 10.0

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

Subtask #10
7.1325301205 / 10.0

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