하하하하 웃어요

#include #include using namespace std; typedef struct { int row; int column; } dot; int dr[] = {0, 0, -1, 1}; int dc[] = {1, -1, 0, 0}; int n, m; int graph[500][500] = {-1, }; bool check[500][500] = {false, }; int pictureNum; int picture[250 * 500] = {0, }; int bfs(dot start) { queue q; q.push(start); check[start.row][start.column] = true; int pictureSize = 1; while (!q.empty()) { dot next = q.f..

#include #include using namespace std; typedef struct { int A; int B; int C; } Bucket; int A, B, C; bool check[201][201] = {false, }; bool answer[201] = {false, }; void bfs(Bucket start) { queue q; q.push(start); while (!q.empty()) { Bucket next = q.front(); q.pop(); if (check[next.A][next.B]) { continue; } else { check[next.A][next.B] = true; } if (next.A == 0) { answer[next.C] = true; } // A -..

#include #include #include #include using namespace std; typedef struct { int m; int n; } dot; int m, n; // m: row, n: column int graph[50][50] = {0, }; bool check[50][50] = {false, }; // west, north, east, south int dm[] = {0, -1, 0, 1}; int dn[] = {-1, 0, 1, 0}; int roomNum; int room[2501] = {0, }; // room[roomNum] = roomSize int bfs(dot start) { queue q; q.push(start); check[start.m][start.n]..