#include #include #include #include #include #include #include #include using namespace std; struct Pos { int y, x; }; struct Node { int type; Pos endPos; }; int main() { int n; cin >> n; vector> grids(n); for (vector& tmpGrids : grids) { for (int x = 0; x < n; x++) { int tmp; cin >> tmp; tmpGrids.push_back(tmp); } } stack st; st.push({ 0, 0, 1 }); int count = 0; while (!st.empty()) { Node current = st.top(); st.pop(); if (grids[current.endPos.y][current.endPos.x] == 1) continue; if (current.type == 1) { if (grids[current.endPos.y - 1][current.endPos.x] == 1) continue; if (grids[current.endPos.y][current.endPos.x - 1] == 1) continue; } if (current.endPos.y == n - 1 && current.endPos.x == n - 1) { count++; continue; } if (current.type == 0) { if (current.endPos.x < n - 1) { st.push({ 0, current.endPos.y, current.endPos.x + 1 }); if (current.endPos.y < n - 1) st.push({ 1, current.endPos.y + 1, current.endPos.x + 1 }); } } else if (current.type == 1) { if (current.endPos.x < n - 1) { st.push({ 0, current.endPos.y, current.endPos.x + 1 }); if (current.endPos.y < n - 1) st.push({ 1, current.endPos.y + 1, current.endPos.x + 1 }); } if (current.endPos.y < n - 1) st.push({ 2, current.endPos.y + 1, current.endPos.x }); } else if (current.type == 2) { if (current.endPos.y < n - 1) { if (current.endPos.x < n - 1) st.push({ 1, current.endPos.y + 1, current.endPos.x + 1 }); st.push({ 2, current.endPos.y + 1, current.endPos.x }); } } } cout << count; return 0; }

코드 #529