oj.uz

Submission #1002844

# Submission time Handle Problem Language Result Execution time Memory
1002844 2024-06-19T20:31:34 Z hyakup MalnaRISC (COI21_malnarisc) C++17
30 / 100
 1 ms 600 KB 
#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; 
            }
            else 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(); 
    }
    
}

Compilation message

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

Subtask #1
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Partially correct

Subtask #2
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Partially correct

Subtask #3
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Partially correct

Subtask #4
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Partially correct

Subtask #5
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Partially correct

Subtask #6
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB Partially correct

Subtask #7
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Partially correct

Subtask #8
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB Partially correct

Subtask #9
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 348 KB Partially correct

Subtask #10
3.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 600 KB Partially correct