BOJ 3055 - 탈출
문제 링크 #include using namespace std; typedef pair pii; int r, c, ans, dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; string mp[55]; bool visited[55][55], found = false; vector water; vector loc; bool check(int x, int y) { return 0 r >> c; for(int i = 0; i > mp[i]; for(int i = 0; i < r; ++i) { for(int j = 0; j < c; ++j) { if(mp[i][j] == 'S') { loc.push_back({i, j}); } else if(mp[i][j..
2020. 1. 10.