oj.uz

Submission #1002445

# Submission time Handle Problem Language Result Execution time Memory
1002445 2024-06-19T14:58:10 Z definitelynotmee MalnaRISC (COI21_malnarisc) C++17
1.125 / 100
 1 ms 460 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;

    mt19937 rng(RANDOM);

    int attempt = 28;

    cout << attempt << '\n';

    const string q = "CMPSWP";

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

    vector<int> o(n);

    iota(all(o),0);
    
    
    while (attempt--){
        shuffle(all(o),rng);
        for(int i = 1; i < n; i+=2){
            if(o[i] < o[i-1])
                swap(o[i],o[i-1]);

            cout << query(o[i-1], o[i]) << ' ';
        }
        cout << '\n';
    }
    

    
    return 0;

}

Subtask #1
1.125 / 10.0

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

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
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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