Submission #2944965

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <cmath>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
using namespace std;
//
const int INF=1e9+7;
const int mod=1e9+7;
//
struct poi{
	int X;int Y;int Z;
	bool operator<(const poi&R)const{
		return X==R.X ? Y==R.Y ? Z<R.Z : Y<R.Y : X<R.X;
	}
};
//
ll GCD(ll a,ll b){
	return (b==0)?(a):(GCD(b,a%b));
}
ll LCM(ll a,ll b){
	return a/GCD(a,b)*b;
}
//
int N,M;
char A[2000][2000];
ll a[4][2000][2000];
ll cul(){
	FOR(i,0,N){
		ROF(j,0,M){
			if(A[i][j]=='.'){
				int cnt=1;
				while(j>=0&&A[i][j]=='.'){
					a[0][i][j]=cnt;
					j--;
					cnt++;
				}
				j++;
			}else{
				a[0][i][j]=0;
			}
		}
	}
	FOR(j,0,M){
		ROF(i,0,N){
			if(A[i][j]=='.'){
				int cnt=1;
				while(i>=0&&A[i][j]=='.'){
					a[1][i][j]=cnt;
					i--;
					cnt++;
				}
				i++;
			}else{
				a[1][i][j]=0;
			}
		}
	}
	FOR(i,0,N){
		FOR(j,0,M){
			if(A[i][j]=='.'){
				int cnt=1;
				while(j<M&&A[i][j]=='.'){
					a[2][i][j]=cnt;
					j++;
					cnt++;
				}
				j--;
			}else{
				a[2][i][j]=0;
			}
		}
	}
	FOR(j,0,M){
		FOR(i,0,N){
			if(A[i][j]=='.'){
				int cnt=1;
				while(i<N&&A[i][j]=='.'){
					a[3][i][j]=cnt;
					i++;
					cnt++;
				}
				i--;
			}else{
				a[3][i][j]=0;
			}
		}
	}
}
ll culcul(){
	ll ans=0;
	FOR(i,0,N){
		FOR(j,0,M){
			if(A[i][j]=='.'){
				ans+=a[0][i][j+1]*a[1][i+1][j];
				ans+=a[1][i+1][j]*a[2][i][j-1];
				ans+=a[2][i][j-1]*a[3][i-1][j];
				ans+=a[3][i-1][j]*a[0][i][j+1];
			}
		}
	}
	return ans;
}
int main(){
	cin>>N>>M;
	FOR(i,0,N){
		FOR(j,0,M){
			cin>>A[i][j];
		}
	}
	cul();
	cout<<culcul()<<endl;
	return 0;
}

Submission Info

Judge Result