oj.uz

답안 #1002459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002459 2024-06-19T15:02:26 Z definitelynotmee Autobahn (COI21_autobahn) C++17
0 / 100
 2 ms 604 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);
    };

    cout << 2*n << '\n';

    int attempt = 2*n;

    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;

}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -