oj.uz

Submission #886347

# Submission time Handle Problem Language Result Execution time Memory
886347 2023-12-11T22:36:28 Z stefanneagu Furniture (JOI20_furniture) C++17
100 / 100
 1526 ms 11812 KB 
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e3 + 5;
int jd[nmax][nmax], ss[nmax][nmax], diag[2 * nmax], n, m;
bool f[nmax][nmax];
bool in(int a, int b) {
  if(a > n || b > m || min(a, b) < 0) {
    return 0;
  }
  return 1;
}
void dfs(int i, int j) {
  if(f[i][j] == 1) {
    return;
  }
  f[i][j] = 1;
  diag[i + j] --;
  ss[i - 1][j] --;
  ss[i][j - 1] --;
  jd[i + 1][j] --;
  jd[i][j + 1] --;
  if(ss[i - 1][j] == 0) {
    dfs(i - 1, j);
  }
  if(ss[i][j - 1] == 0) {
    dfs(i, j - 1);
  }
  if(jd[i + 1][j] == 0) {
    dfs(i + 1, j);
  }
  if(jd[i][j + 1] == 0) {
    dfs(i, j + 1);
  }
}
int main() {
  cin >> n >> m;
  for(int i = 0; i <= n + 1; i ++) {
    f[i][0] = 1;
    f[i][m + 1] = 1;
  }
  for(int j = 0; j <= m + 1; j ++) {
    f[0][j] = 1;
    f[n + 1][j] = 1;
  }
  for(int i = 1; i <= n; i ++) {
    for(int j = 1; j <= m; j ++) {
      diag[i + j] ++;
      jd[i + 1][j] += 1;
      jd[i][j + 1] += 1;
      ss[i - 1][j] += 1;
      ss[i][j - 1] += 1;
    }
  }
  for(int i = 1; i <= n; i ++) {
    for(int j = 1; j <= m; j ++) {
      int a;
      cin >> a;
      if(a == 1) {
        dfs(i, j);
        //cout << i << " " << j << endl;
      }
    }
  }
  int q;
  cin >> q;
  for(int i = 1; i <= q; i ++) {
    int a, b;
    cin >> a >> b;
    if(f[a][b] == 1 || diag[a + b] != 1) {
      cout << "1\n";
      dfs(a, b);
    } else {
      cout << "0\n";
    }
  }
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 7 ms 4444 KB Output is correct
4 Correct 12 ms 4440 KB Output is correct
5 Correct 13 ms 4440 KB Output is correct
6 Correct 15 ms 4444 KB Output is correct
7 Correct 15 ms 4444 KB Output is correct
8 Correct 16 ms 4444 KB Output is correct
9 Correct 16 ms 4660 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 7 ms 4444 KB Output is correct
4 Correct 12 ms 4440 KB Output is correct
5 Correct 13 ms 4440 KB Output is correct
6 Correct 15 ms 4444 KB Output is correct
7 Correct 15 ms 4444 KB Output is correct
8 Correct 16 ms 4444 KB Output is correct
9 Correct 16 ms 4660 KB Output is correct
10 Correct 39 ms 4440 KB Output is correct
11 Correct 10 ms 4440 KB Output is correct
12 Correct 526 ms 10140 KB Output is correct
13 Correct 116 ms 9048 KB Output is correct
14 Correct 1254 ms 10684 KB Output is correct
15 Correct 1301 ms 10668 KB Output is correct
16 Correct 1387 ms 11228 KB Output is correct
17 Correct 1477 ms 11356 KB Output is correct
18 Correct 1437 ms 11100 KB Output is correct
19 Correct 1510 ms 11812 KB Output is correct
20 Correct 1515 ms 11604 KB Output is correct
21 Correct 1526 ms 11720 KB Output is correct