제출 #1111332

#제출 시각아이디문제언어결과실행 시간메모리
1111332vjudge1Tetris (COCI17_tetris)C++17
0 / 80
1 ms336 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, m;
char a[N][N];
int b[2];

int main() {
  cin >> n >> m;

  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }

  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (a[i][j] == '.') continue;

      if (i + 1 < n && j + 1 < m &&
          a[i + 1][j] == a[i][j] &&
          a[i][j + 1] == a[i][j] &&
          a[i + 1][j + 1] == a[i][j]) {
        ++b[0];
      }

      if (j + 3 < m &&
          a[i][j + 1] == a[i][j] &&
          a[i][j + 2] == a[i][j] &&
          a[i][j + 3] == a[i][j]) {
        ++b[1];
      }
      if (i + 3 < n &&
          a[i + 1][j] == a[i][j] &&
          a[i + 2][j] == a[i][j] &&
          a[i + 3][j] == a[i][j]) {
        ++b[1];
      }
    }
  }

  cout << b[0] << " " << b[1] << endl;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...