//https://www.acmicpc.net/problem/4963 #include #include #include using namespace std; bool map[50][50];bool visited[50][50];int cnt;int w, h;int dy[8]={-1, -1, -1, 0, 0, 1, 1, 1};int dx[8]={-1, 0, 1, -1, 1, -1, 0, 1};void bfs(int y, int x){ queue q; q.push(make_pair(y,x)); map[y][x]=0; int nowy; int nowx; while(!q.empty()){ nowy=q.front().first; nowx=q.front().second; q.pop(); for(int i=0; i> w..
//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..
//https://www.acmicpc.net/problem/2660 #include #include using namespace std;bool frd[51][51];bool visit[51];int score[51];int list[51];int n;int mn=51*51;int num; void input();int bfs(int people);void find();void init(); int main(){ input(); for(int i=1; i> n; int a=1, b=1; while(a!=-1 && b!=-1) { cin >> a >> b; frd[a][b]=frd[b][a]=1; }} int bfs(int people){ queue q; int tmp_cnt=1; int scr=-1; ..
