Submission #75236081

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)

vector<string> grid;
int h,w;
bool is_symmetry(int y, int x, int dy, int dx) {
  int h1 = y, h2  = y + dy, w1 = x, w2 = x + dx;
  bool flag = true;
  for (int i = h1;i <= h2;i++) {
    for (int j = w1; j <= w2;j++) {
      if (grid[i][j] != grid[h1+h2-i][w1+w2-j])flag = false;
    }
  }

  return flag;
}

int main() {
  cin >> h >> w; 
  grid.resize(h);
  REP(i,h)cin >> grid[i];


  int ans = 0;
  for (int i = 0;i < h;i++) {
    for (int j = 0;j < w;j++) {
      // i,jが始点
      for (int dh = 0;dh < h - i;dh++) {
        for (int dw = 0;dw < w - j;dw++) {
          if(is_symmetry(i,j,dh,dw))ans++;
        }
      }
    }
  }

  cout << ans << endl;
}

Submission Info

Judge Result