알고리즘 문제 풀이/1DP_과제(~180615)
180210_3055_탈출
//https://www.acmicpc.net/problem/3055 #include #include #include using namespace std;char map[52][52];int visited[52][52];int R, C;int sy1, sx1, desy, desx;bool wchk;int cnt;int dy[4]={0,0,1,-1};int dx[4]={1,-1,0,0};queue water; void input(){ cin >> R >> C; for(int i=0; i> map[i]; } void find_start_point(){ for(int i=0; i q; q.push(make_pair(sy1,sx1)); int cnt2=0; int tmp=cnt; int tmp2=..
