class
-
백준 - 파이프 옮기기 1 [17070]공부/baekjoon 문제 2019. 6. 13. 15:32
#include #include #include using namespace std; class node { public: int i; int j; int status; node(int _i, int _j, int _status) { i = _i; j = _j; status = _status; } node() { i = 0; j = 0; status = 0; } }; int map[16][16]; int result; queue q; void bfs(int n) { q.push(node(0,1,1)); node temp; int status; int i; int j; int right, below, diagonal; while (!q.empty()) { temp = q.front(); i = temp.i..