Submission #75246949

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>

#define LF putchar('\n')

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353LL; //1000000007LL;
static const LLONG INF_NUM = 1e18;
static const int CH_KIND = 'z' - 'a' + 1;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}
template <class _T> static _T tp_pow(int x, int exp)
{
	_T ans = 1;
	_T base = x;
	while (exp > 0) {
		if (exp & 1) {
			ans = (ans * base);
		}
		base = (base * base);
		exp >>= 1;
	}
	return ans;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

static void task()
{
    int H, W;
    get(H, W);

    std::vector<std::string> grid(H);
    for (int h = 0; h < H; h++) {
        get(grid[h]);
    }

    int ans = 0;
    for (int h1 = 0; h1 < H; h1++) {
        for (int w1 = 0; w1 < W; w1++) {
            for (int h2 = h1; h2 < H; h2++) {
                for (int w2 = w1; w2 < W; w2++) {
                    bool ok = true;
                    for (int i = h1; i <= h2; i++) {
                        for (int j = w1; j <= w2; j++) {
                            if ((h1 + h2 - i >= H) || (w1 + w2 - j >= W)) ok = false;
                            if (grid[i][j] != grid[h1 + h2 - i][w1 + w2 - j]) ok = false;
                            if (!ok) break;
                        }
                    }
                    if (ok) ans++;
                }
            }
        }
    }
    printf("%d\n", ans);
}

Submission Info

Judge Result