oj.uz

Submission #1003017

# Submission time Handle Problem Language Result Execution time Memory
1003017 2024-06-20T01:27:16 Z definitelynotmee MalnaRISC (COI21_malnarisc) C++17
13.2953 / 100
 1 ms 348 KB 
#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 = 10;
    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.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer parameter [name=t] equals to 30, violates the range [1, 28]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #3
1.1666666667 / 10.0

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

Subtask #4
4.7111111111 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #6
7.4174757282 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -