Submission #1053315

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053315		SzymonKrzywda	경찰관과 강도 (BOI14_coprobber)	C++17	0 / 100	3047 ms	2392 KiB

coprobber

#include <bits/stdc++.h>
 
using namespace std;
 
vector<int> graf[500];
int odl[500][500];

int akt_pos = 0;
 
int start(int n,bool A[][500] ){
    for (int i=0; i<n; i++){
        for (int j=0; j<n; j++){
            if (A[i][j]) graf[i].push_back(j);
        }
    }
    
    
    for (int i=0; i<n; i++){
        vector<bool> odwiedzone(n,false);
        queue<pair<int,int>> kolejka;
        
        odwiedzone[i] = true;
        kolejka.push({0,i});
        
        
        while (!kolejka.empty()){
            int v = kolejka.front().second;
            int val = kolejka.front().first;
            odl[i][v] = val;
            for (int s : graf[v]){
                if (!odwiedzone[s]){
                    odwiedzone[s] = true;
                    kolejka.push({val+1,s});
                }
            }
        }
        
        
    }
    
    
    
    return 0;
    
    
}
 
 
int nextMove(int R){
    
    int akt_k,akt_m=1e8;
    
    for (int s : graf[akt_pos]){
        int maxi=0;
        for (int s_2 : graf[s]){
            maxi = max(maxi,odl[s_2][R]);
        }
        
        if (maxi < akt_m){
            akt_k = s;
            akt_m = maxi;
        }
        
    }
    
    
    
    return akt_k;
}

Compilation message (stderr)

coprobber.cpp: In function 'int nextMove(int)':
coprobber.cpp:68:12: warning: 'akt_k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |     return akt_k;
      |            ^~~~~

• Subtask 1: 0 / 16
• Subtask 2: 0 / 14
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40