#include #include #include using namespace std; vector> dot_arr; vector> visited; vector> table; queue> pairs; vector x_move = { 1,-1,0,0 }; vector y_move = { 0,0,-1,1 }; int n, m, result; void bfs(vector> dot_arr) { for (pairdots : dot_arr) { pairs.push({ dots.first, dots.second }); visited[dots.first][dots.second] = true; } while (!pairs.empty()) { pair each_dot = pairs.front(); pairs.pop(); for (int i = 0; i < 4; i++) { int new_x = each_dot.first + x_move[i]; int new_y = each_dot.second + y_move[i]; //cout << "new_x, new_y for value:" << new_x << ", " << new_y << "\n"; if ( 0 <= new_x && new_x < n && 0 <= new_y && new_y < m && table[new_x][new_y] == 0 && !visited[new_x][new_y]) { // cout <<"new_x, new_y for value:"<> m >> n; table.resize(n, vector(m)); visited.resize(n, vector(m)); int max = 0; int cnt_for_0 = 0; for (int i = 0;i< n; i++) { for (int j = 0; j < m; j++) { cin >> table[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (table[i][j] == 0) { cnt_for_0 += 1; } if (table[i][j] == 1) { dot_arr.push_back({ i,j }); } } } bfs(dot_arr); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { //cout << table[i][j]<<" "; if (max < table[i][j]) { max = table[i][j]; } if (table[i][j] == 0) { max= 0; break; } } cout<<"\n"; } if (cnt_for_0 > 0) { cout << max - 1; } else { cout << 0; } }

제출 #147865

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: