//https://www.acmicpc.net/problem/14500 #include #include using namespace std; int map[500][500];bool visited[500][500]; int dy[4]={0,0,1,-1};int dx[4]={1,-1,0,0};int N, M;int mx=0; void solve(int y, int x, int now);void dfs(int y, int x, int now, int depth); int main(){ cin >> N >> M; for(int i=0; i map[i][j]; } } for(int i=0; i
//https://www.acmicpc.net/problem/12100 #include using namespace std;#define UP 0#define DOWN 1#define LEFT 2#define RIGHT 3int mx=0;int N;int board[20][20][2];int cache[6][20][20];void solve(int dir, int depth); int main(){ cin >> N; for(int i=0; i board[i][j][0]; cache[0][i][j]=board[i][j][0]; } for(int i=0; i
//https://www.acmicpc.net/problem/2146 #include #include using namespace std;bool map[100][100];int visited[100][100];int visited2[100][100];int N, cnt;int min1=10001; int dy[4]={0,0,1,-1};int dx[4]={1,-1,0,0}; void dfs(int y, int x, int land){ visited[y][x]=land; for(int i=0; i=0 && ny=0 && nx