제출 #1002840

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002840		hyakup	MalnaRISC (COI21_malnarisc)	C++17	0 / 100	1 ms	604 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; 
    queue<vector<pii>> resp; 
    while( ok ) {
        for( int i = 1; i <= n ;i++ ) marc[i] = 0; 
        ok = false ;
        vector<pii> v; 
        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;
                v.push_back(fila[i].front()); 
                fila[i].pop(); 
                if( !fila[i].empty() ) ok = true; 
            }
        }
        resp.push(v); 
    }

    cout << resp.size() << endl; 
    while( !resp.empty() ){
        for( auto[ a, b ] : resp.front() ) cout << "CMPSWP R" << a << " R" << b << " "; cout << endl; 
        resp.pop(); 
    }
    
}

컴파일 시 표준 에러 (stderr) 메시지

malnarisc.cpp: In function 'int main()':
malnarisc.cpp:42:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   42 |         for( auto[ a, b ] : resp.front() ) cout << "CMPSWP R" << a << " R" << b << " "; cout << endl;
      |         ^~~
malnarisc.cpp:42:89: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   42 |         for( auto[ a, b ] : resp.front() ) cout << "CMPSWP R" << a << " R" << b << " "; 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