//https://www.acmicpc.net/problem/13460 #include #include using namespace std; #define UP 0#define DOWN 1#define LEFT 2#define RIGHT 3 class ball{public : int x; int y; ball(int _x=0, int _y=0) : x(_x), y(_y) {}};char map[10][10];char cache[11][10][10];int N, M;int mn=11; ball R;ball B;int chk; //map inputvoid input(){ cin >> N >> M; for(int i=0; i map[i][j]; if(map[i][j]=='R'){ R.y=i; R.x=j; } ..
//https://www.acmicpc.net/problem/14716 #include #include #include using namespace std; bool map[250][250];//bool visited[250][250]; int N, M;int dy[8]={-1,-1,-1,0,0,1,1,1};int dx[8]={-1,0,1,-1,1,-1,0,1}; void input();void bfs(int y, int x); int main(){ int ans=0; input(); for(int i=0; i>N; for(int i=0; i map[i][j]; } }} void bfs(int y, int x){ queue q; q.push(make_pair(y, x)); map[y][x]=0; whil..
//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..