#include using namespace std;int map[102][102];bool visit[102][102];int N; int dx[4]={1, -1, 0, 0};int dy[4]={0, 0, 1, -1}; void dfs(int y, int x, int r_height){ visit[y][x] = 1; for(int i=0; i0 && !visit[ny][nx]) { dfs(ny, nx, r_height); } }} int main(){ int m_height=0; int m_area=1; cin >> N; /*input*/ for(int i=1; i map[i][j]; if(m_height
#include #include using namespace std;bool map[100][100] ;bool visit[100][100];int v[5000];int n_area;int nv;int M, N, K; int dx[4]={ 1, -1, 0, 0};int dy[4]={ 0, 0, 1, -1}; void dfs(int y, int x){nv++; //넓이for(int i=0; i=0 && ny=0 && nx> M >> N >> K; /*input*/for (int i = 0; i < K; i++){int x1, y1, x2, y2;cin ..
#include #include using namespace std; bool G[102][102]; int find(int start, int end, int N) { bool visited[102] = { 0 }; queue q; q.push(start); int next; int now = q.front(); while (!q.empty()) { now = q.front(); q.pop(); for (int i = 1; i > N; input_G(N); for (int i = 1; i
#include #include using namespace std; struct cord { int x; int y; }; bool map[102][102]; int visited[102][102]; void input_map(int N, int M) { char c; for (int i = 1; i c; if (c == '1') map[i][j] = 1; else map[i][j] = 0; } } int solv_maze(int n, int m, cord s) { //int cnt = 0; queue q; q.push(s); cord next; cord now = q.front(); visited[now.y][now.x] = 1; while (!q.empty()) { now = q.front(); q..
