Submission #1944136

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) (x=min(x,y))
#define chmax(x,y) (x=max(x,y))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 260
string s[N];
int h, w;

bool check(int xl, int xr, int yl, int yr){
	if(xl<0||xr>=h||yl<0||yr>=w) return false;
	rep(i, yr-yl+1) if(s[xl][yl+i]!=s[xr][yr-i]) return false;
	return true;
}

ll f(ll a, ll b){
	return (b-a+1)/2;
}

int count(int xl, int xr, int yl, int yr){
	if(!check(xl, xr, yl, yr)) return 0;
	ll yl2 = yl, yr2 = yr;
	ll res = 0;
	while(yl-1>=0&&yr+1<w){
		if(s[xl][yl-1]==s[xr][yr+1]&&s[xr][yl-1]==s[xl][yr+1]){
			yl--;
			yr++;
		} else break;
	}
	if(xl<xr) res += f(yl, yr);
	while(true){
		xl--; xr++;
		if(xl<0||xr>h) return res;
		ll yl3 = yl2, yr3 = yr2;
		if(!check(xl, xr, yl3, yr3)) return res;
		while(yl3-1>=yl&&yr3+1<=yr&&s[xl][yl3-1]==s[xr][yr3+1]&&s[xr][yl3-1]==s[xl][yr3+1]){
			yl3--;
			yr3++;
		}
		yl = yl3;
		yr = yr3;
		res += f(yl, yr);
	}
}

int main(){
	cin>>h>>w;
	rep(i, h) cin>>s[i];
	ll res = 0;
	rep(i, h) rep(j, w){
		//cerr<<"calc "<<i<<" "<<j<<endl;
		res += count(i, i, j, j); //cerr<<res<<endl;
		res += count(i, i+1, j, j); //cerr<<res<<endl;
		res += count(i, i, j, j+1); //cerr<<res<<endl;
		res += count(i, i+1, j, j+1); //cerr<<res<<endl;
	}
	cout<<res<<endl;
	return 0;
}

Submission Info

Judge Result