oj.uz

Submission #886859

# Submission time Handle Problem Language Result Execution time Memory
886859 2023-12-13T05:25:26 Z NeroZein Dango Maker (JOI18_dango_maker) C++17
0 / 100
 83 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 3003;

char c[N][N]; 
int used[N][N];
set<int> g[N * N]; 
bool in_que[N * N]; 
int intersect[N * N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> c[i][j];
    }
  }
  int tmp = 0, num = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m - 2; ++j) {
      if (c[i][j] == 'R' && c[i][j + 1] == 'G' && c[i][j + 2] == 'W') {
        tmp++; num++;
        used[i][j] = used[i][j + 1] = used[i][j + 2] = num; 
      }
    }
  }
  int original = num; 
  for (int i = 0; i < n - 2; ++i) {
    for (int j = 0; j < m; ++j) {
      if (c[i][j] == 'R' && c[i + 1][j] == 'G' && c[i + 2][j] == 'W') {
        num++; 
        for (int k = 0; k < 3; ++k) {
          if (used[i + k][j]) {
            intersect[num]++; 
          }
        }
        for (int k = 0; k < 3; ++k) {
          if (used[i + k][j]) {
            g[num].insert(used[i + k][j]);
            g[used[i + k][j]].insert(num); 
          }
        }          
        if (intersect[num] == 0) {
          tmp++; 
        }
      }
    }
  }
  //deb(tmp) cout << '\n';
  int ans = tmp; 
  queue<int> que; 
  for (int i = 1; i <= original; ++i) {
    for (int u : g[i]) {
      if (intersect[u] == 1) {
        in_que[i] = true; 
        que.push(i); 
        break; 
      }      
    }
  }
  while (!que.empty()) {
    int v = que.front();
    que.pop(); 
    ans--;
    for (int u : g[v]) {
      --intersect[u];
      g[u].erase(v);
      if (intersect[u] == 0) {
        ans++; 
      } else if (intersect[u] == 1) {
        int z = *g[u].begin();
        if (!in_que[z]) {
          que.push(*g[u].begin());
          in_que[z] = true; 
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -