oj.uz

Submission #520495

# Submission time Handle Problem Language Result Execution time Memory
520495 2022-01-30T07:34:55 Z Vimmer MalnaRISC (COI21_malnarisc) C++14
10.192 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")

#define F first
#define S second
#define PB push_back
#define M ll(1e9 + 7)
#define sz(x) (ll)x.size()
#define N 1000500
#define pri(x) cout << x << endl
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

using namespace std;
//typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;

int main()
{
    istream::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    vector <pair <int, int> > vr; vr.clear();

    for (int i = n; i >= 2; i--)
        for (int j = 1; j < i; j++)
            vr.PB({j, i});

    pri(sz(vr));

    for (auto it : vr)
        cout << "CMPSWP " << "R" << it.F _ "R" << it.S << endl;
}

Subtask #1
1.125 / 10.0

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

Subtask #2
1.0357142857 / 10.0

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

Subtask #3
1.0217391304 / 10.0

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

Subtask #4
1.004587156 / 10.0

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

Subtask #5
1.0015673981 / 10.0

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

Subtask #6
1.0010570825 / 10.0

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

Subtask #7
1.0008045052 / 10.0

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

Subtask #8
1.0006327112 / 10.0

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

Subtask #9
1.0005105948 / 10.0

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

Subtask #10
1.0004206984 / 10.0

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