Submission #520603

# Submission time Handle Problem Language Result Execution time Memory
520603 2022-01-30T10:03:26 Z N1NT3NDO MalnaRISC (COI21_malnarisc) C++14
10.192 / 100
2 ms 460 KB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define fi first
#define sd second
#define all(vec) vec.begin(), vec.end()

using namespace std;

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int n;
    cin >> n;
    vector< pair<int, int> > ans;
    for(int i = 1; i < n; i++)
      for(int j = i + 1; j <= n; j++)
          ans.pb({i, j});

    cout << sz(ans) << '\n';
    for(auto u : ans) cout << "CMPSWP " << "R" << u.fi << ' ' << "R" << u.sd << '\n';
}
# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 204 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 316 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 332 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 332 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 332 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 332 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 332 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 332 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 460 KB Partially correct