# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641150 | maks007 | Game (eJOI20_game) | C++14 | 257 ms | 524288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define N (int)20
int cnt, n, m, used[N][N], deg[N][N];
char a[N][N], b[N][N];
void dfs(int i, int j) {
used[i][j] = cnt;
if(b[i][j] == '0') {
int ni = i, nj = j - 1;
if(ni >= 0 && ni < n && nj >= 0 && nj < m) dfs(ni, nj);
}
if(b[i][j+1] == '0') {
int ni = i, nj = j + 1;
if(ni >= 0 && ni < n && nj >= 0 && nj < m) dfs(ni, nj);
}
if(a[i][j] == '0') {
int ni = i-1, nj = j;
if(ni >= 0 && ni < n && nj >= 0 && nj < m) dfs(ni, nj);
}
if(a[i+1][j] == '0') {
int ni = i+1, nj = j;
if(ni >= 0 && ni < n && nj >= 0 && nj < m) dfs(ni, nj);
}
}
signed main () {
cnt = 1;
scanf("%d%d", &n, &m);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |