Submission #1002469

#TimeUsernameProblemLanguageResultExecution timeMemory
1002469definitelynotmeeMalnaRISC (COI21_malnarisc)C++17
75.63 / 100
1 ms348 KiB
#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); }; cout << n+(n&1) << '\n'; int attempt = (n+1)/2; while(attempt--){ for(int i = 0; i+1 < n; i+=2){ cout << query(i,i+1) << ' '; } cout << '\n'; for(int i = 1; i+1 < n; i+=2) cout << query(i,i+1) << ' '; cout << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...