# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641145 | maks007 | Game (eJOI20_game) | C++14 | 1 ms | 296 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"
signed main () {
int n, m;
scanf("%d%d", &n, &m);
char a[n + 1][m], b[n][m + 1];
for(int i = 0; i <= n; i ++) {
for(int j = 0; j < m; j ++) std::cin >> a[i][j];
}
for(int i = 0; i < n; i ++) {
for(int j = 0; j <= m; j ++) std::cin >> b[i][j];
}
std::queue <std::pair <int,int>> q;
int used[n][m];
memset(used, 0, sizeof(used));
int deg[n][m];
memset(deg, 0, sizeof(deg));
for(int i = 0; i < n; i ++ ) {
for(int j = 0; j < m; j ++) {
deg[i][j] += (a[i][j] == '1') + (a[i+1][j] == '1') + (b[i][j] == '1') + (b[i][j + 1] == '1');
}
}
int cnt = 1;
for(int i = 0; i < n; i ++) {
for(int j = 0; j < m; j ++) {
if(used[i][j] || deg[i][j] == 4) continue;
used[i][j] = cnt;
q.push({i, j});
while(!q.empty()) {
std::pair <int,int> v = q.front();
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... |