제출 #1002831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002831		hyakup	MalnaRISC (COI21_malnarisc)	C++17	0 / 100	1 ms	600 KiB

malnarisc

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define bug(x) cout << #x << " " << x << endl;
#define pii pair<int, int> 


const int inf = 1e9 + 10; 
const int maxn = 100; 

queue<pii> fila[maxn]; 
vector<int> marc( maxn ); 

int main(){
    int n; cin >> n; 
    for( int i = 1; i < n; i++ ){
        for( int j = 1; j <= n - i; j++ ){
            fila[i].push({j, j + 1}); 
        }
    }
    
    bool ok = true; 
    while( ok ) {
        for( int i = 1; i <= n ;i++ ) marc[i] = 0; 

            ok = false ;
        for( int i = 1; i < n; i++ ){
            if( !fila[i].empty() && !marc[fila[i].front().first] && !marc[fila[i].front().second] ){
                marc[fila[i].front().first] = 1;
                marc[fila[i].front().second] = 1;
                cout << "CMPSWP R" << fila[i].front().first << " R" << fila[i].front().second << " ";  
                fila[i].pop(); 
                if( !fila[i].empty() ) ok = true; 
            }
        }
        cout << endl; 
    }
}

• 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