[C++] 백준 1012 유기농 배추
#include using namespace std; const int dy[4]={-1, 0, 1, 0}; const int dx[4]={0, 1, 0, -1}; int t, m, n, k, a[52][52], x, y; int visited[52][52], cnt, ret[3]; void dfs(int y, int x){ visited[y][x] = 1; for(int i=0; i> t; while(t--){ cnt=0; fill(&a[0][0], &a[0][0]+52*52, 0); fill(&visited[0][0], &visited[0][0]+52*52, 0); cin >> m >> n >> k; for(int i=0; i> x >> y; a[y][x] = 1; } for(int i=0; i
2023. 7. 31.
[C++] 백준 2178 미로탐색
#include using namespace std; int n, m; string s; int a[104][104]; int visited[104][104]; int y, x, c, d; const int dy[] = {-1, 0, 1, 0}; const int dx[] = {0, 1, 0, -1}; void bfs(int y, int x){ visited[y][x] = 1; queue q; q.push({y, x}); while(q.size()){ tie(c, d) = q.front(); q.pop(); for(int i=0; i> n >> m; for(int i=0; i> s; for(int j=0; j
2023. 7. 30.
