Submission #998011

#	Time	Username	Problem	Language	Result	Execution time	Memory
998011		arbuzick	MalnaRISC (COI21_malnarisc)	C++17	76.85 / 100	1 ms	348 KiB

malnarisc

#include <bits/stdc++.h>

using namespace std;

int sort(vector<int> inds, vector<vector<pair<int, int>>> &ans) {
    if (inds.size() == 1) {
        return 0;
    }
    vector<int> inds1, inds2;
    for (int i = 0; i < (int)inds.size(); ++i) {
        if (i % 2 == 0) {
            inds1.push_back(inds[i]);
        } else {
            inds2.push_back(inds[i]);
        }
    }
    int pos = max(sort(inds1, ans), sort(inds2, ans));
    for (int i = 0; i < ((int)inds.size() + 1) / 2; ++i) {
        if ((int)ans.size() <= pos) {
            ans.push_back({});
        }
        for (int j = i; j + 1 < (int)inds.size(); j += 2) {
            ans[pos].emplace_back(inds[j], inds[j + 1]);
        }
        pos++;
    }
    return pos;
}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    iota(a.begin(), a.end(), 1);
    vector<vector<pair<int, int>>> ans;
    sort(a, ans);
    cout << ans.size() << '\n';
    for (auto v : ans) {
        for (auto p : v) {
            cout << "CMPSWP R" << p.first << " R" << p.second;
            if (p != v.back()) {
                cout << ' ';
            }
        }
        cout << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 8.25 / 10
• Subtask 3: 8.4444444444 / 10
• Subtask 4: 7.6666666667 / 10
• Subtask 5: 7.1481481481 / 10
• Subtask 6: 7.213592233 / 10
• Subtask 7: 7.0526315789 / 10
• Subtask 8: 7.0303030303 / 10
• Subtask 9: 7.0402684564 / 10
• Subtask 10: 7.0060240964 / 10