Submission #1003019

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003019		definitelynotmee	MalnaRISC (COI21_malnarisc)	C++17	24.89 / 100	0 ms	348 KiB

malnarisc

#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define O_O
using namespace std;
template <typename T>
using bstring = basic_string<T>;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double dbl;
typedef long double dbll; 
const ll INFL = 4e18+25;
const int INF = 1e9+42;
const double EPS = 1e-7;
const int MOD = (1<<23)*17*7 + 1; // 998244353
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;

int main(){
    
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;

    auto query =[&](int a, int b){
        return string("CMPSWP") + " R" + to_string(a+1) + " R" + to_string(b+1) + " ";
    };

    vector<string> perg(30);

    auto solve =[&](int l, int r, int level, auto && solve){
        if(l == r)
            return;
        int m = (l+r)>>1;
        int odd = (r-l+1)&1;

        for(int i = 0; i < (r-l+1)/2; i++){
            perg[level]+=query(m-i-odd, m+i+1);
        }

        solve(l,m,level+1,solve);
        solve(m+1,r,level+1,solve);
    };

    solve(0,n-1,0,solve);
    
    while(perg.back() == string(""))
        perg.pop_back();
    
    int iter = sqrt(n);
    cout << iter*perg.size() << '\n';
    for(int i = 0; i < iter; i++){
        for(string j : perg)
            cout << j << '\n';
    }
    

    
    return 0;

}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 8.0555555556 / 10
• Subtask 4: 8.6 / 10
• Subtask 5: 0 / 10
• Subtask 6: 8.2330097087 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10