#include #include #include #include using namespace std; int main(){ int n; int m; int f; cin >> m >> n >> f; vector> v(n*f,vector(m,0)); int sd = 0; queue> q; for(int i=0;i> num; if(num == 0){ sd = 1; } if(num == 1){ vector a; a.push_back(i); a.push_back(j); a.push_back(0); q.push(a); } v[i][j] = num; } } if(sd == 0){ cout << "0" << endl; return 0; } set set; while(q.size() != 0){ int y = q.front()[0]; int x = q.front()[1]; int t = q.front()[2]; q.pop(); if(y+1 < n*f){ if(v[y+1][x] == 0){ vector a; a.push_back(y+1); a.push_back(x); a.push_back(t+1); q.push(a); set.insert(t+1); v[y+1][x] = 1; } } if(y-1 >= 0){ if(v[y-1][x] == 0){ vector a; a.push_back(y-1); a.push_back(x); a.push_back(t+1); q.push(a); set.insert(t+1); v[y-1][x] = 1; } } if(x+1 < m){ if(v[y][x+1] == 0){ vector a; a.push_back(y); a.push_back(x+1); a.push_back(t+1); q.push(a); set.insert(t+1); v[y][x+1] = 1; } } if(x-1 >= 0){ if(v[y][x-1] == 0){ vector a; a.push_back(y); a.push_back(x-1); a.push_back(t+1); q.push(a); set.insert(t+1); v[y][x-1] = 1; } } if(y+n < n*f){ if(v[y+n][x] == 0){ vector a; a.push_back(y+n); a.push_back(x); a.push_back(t+1); q.push(a); set.insert(t+1); v[y+n][x] = 1; } } if(y-n >= 0){ if(v[y-n][x] == 0){ vector a; a.push_back(y-n); a.push_back(x); a.push_back(t+1); q.push(a); set.insert(t+1); v[y-n][x] = 1; } } } for(int i=0;i

제출 #61665

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: