알고리즘 문제 풀이/1DP_과제(~180615)
180406_14502_연구소
//https://www.acmicpc.net/problem/14502 #include #include #include using namespace std; int map[8][8];int secure[8][8];bool visited[8][8];bool visited2[8][8];int N, M;int mx;int dy[4]={0,0,-1,1};int dx[4]={-1,1,0,0};int virus[10][2];int num;queue q;void input(){ cin >> N >> M; for(int i=0; i map[i][j]; if(map[i][j]==2){ virus[num][0]=i; virus[num++][1]=j; } } }} void solve(int y, int x, int wall..
