제출 #559950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
559950		Yazan_Alattar	MalnaRISC (COI21_malnarisc)	C++14	0 / 100	1 ms	340 KiB

malnarisc

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 100007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

vector < pair <int,int> > v;

bool cmp(int a, int b){
    v.pb({a, b});
    return a < b;
}

int n, a[M], cnt;
bool vist[M];


int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) a[i] = n - i + 1;
    sort(a + 1, a + n + 1, cmp);

    for(auto i : v){
        if(vist[i.F] || vist[i.S]){
            ++cnt;
            for(int j = 1; j <= n; ++j) vist[j] = 0;
        }
        vist[i.F] = vist[i.S] = 1;
    }

    cout << cnt << endl;
    for(auto i : v){
        if(vist[i.F] || vist[i.S]){
            for(int j = 1; j <= n; ++j) vist[j] = 0;
            cout << endl;
        }
        vist[i.F] = vist[i.S] = 1;

        cout << "CMDSWP R" << i.F << " R" << i.S << " ";
    }
    cout << endl;
    return 0;
}

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