oj.uz

Submission #251337

# Submission time Handle Problem Language Result Execution time Memory
251337 2020-07-20T21:35:00 Z Bruteforceman Zoo (COCI19_zoo) C++11
45 / 110
 2000 ms 7288 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
bool vis[maxn][maxn];
char s[maxn][maxn];
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
int n, m;
bool inside(int i, int j) {
  return (0 <= i && i < n) && (0 <= j && j < m);
}

void dfs(int x, int y) {
  vis[x][y] = true;
  for(int k = 0; k < 4; k++) {
    int i = x + dx[k];
    int j = y + dy[k];
    if(inside(i, j) && s[i][j] == s[0][0] && !vis[i][j]) {
      dfs(i, j);
    }
  }
}

int main() {
  scanf("%d %d", &n, &m);
  int total = 0;
  for(int i = 0; i < n; i++) {
    scanf("%s", s[i]);
    for(int j = 0; j < m; j++) {
      total += (s[i][j] != '*');
    }
  }
  int ans = 0;
  while(true) {
    dfs(0, 0);
    char inv = (s[0][0] == 'T') ? 'B' : 'T';
    int cover = 0;
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < m; j++) {
        if(vis[i][j]) {
          ++cover;
          s[i][j] = inv;
          vis[i][j] = false;
        }
      }
    }
    ++ans;
    if(cover == total) break; 
  }
  printf("%d\n", ans);
  return 0;
}

Compilation message

zoo.cpp: In function 'int main()':
zoo.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &m);
   ~~~~~^~~~~~~~~~~~~~~~~
zoo.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s[i]);
     ~~~~~^~~~~~~~~~~~

Subtask #1
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 8 ms 640 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 8 ms 640 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 23 ms 3968 KB Output is correct
17 Correct 24 ms 4096 KB Output is correct
18 Correct 23 ms 4096 KB Output is correct
19 Correct 30 ms 4480 KB Output is correct
20 Correct 23 ms 3968 KB Output is correct
21 Execution timed out 2099 ms 7288 KB Time limit exceeded
22 Halted 0 ms 0 KB -