유사BFS
-
5653. [모의 SW 역량테스트] 줄기세포배양SWexpertAcademy 2019. 7. 26. 01:07
#include #include #include #include using namespace std; int dx[] = { 0,0,1,-1 }; int dy[] = { 1,-1,0,0 }; struct node { int x; int y; int time; node(int a, int b, int c) { x = a; y = b; time = c; } }; int tc; int map[800][800]; int n, m, k; int answer; void initial() { for (int i = 0; i < 800; i++) { for (int j = 0; j < 800; j++) { map[i][j] = 0; } } } int main() { scanf("%d", &tc); for (int tn..