Submission #1516737

---

Source Code Expand

#include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <functional>
#include <cstdlib>
#include <queue>
#include <tuple>
#include <map>
#include <cmath>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define DFOR(i,a) for(int i=(a);i>=0;i--)
#define SORT(v, n) sort(v, v+n)

using namespace std;

const double EPS =1e-9;
const long INF =999999999;
const long MINF =-999999999;

//Atcoder Contest 018 ProblemC
int table[501][501][4]={};
int C,R;

int main(){
	int i,j,r,K,counter=0;
	bool flug;
	string S[500];

	cin>>R>>C>>K;
	FOR(i,0,R) cin>>S[i];
	
	FOR(i,0,C){
		if(S[0][i]=='o') table[0][i][0]=1;
		if(S[R-1][i]=='o') table[R-1][i][1]=1;

		FOR(j,1,R){
			if(S[j][i]=='o')
				table[j][i][0]=table[j-1][i][0]+1;
			else 
				table[j][i][0]=0;
		}
		DFOR(j,R-2){
			if(S[j][i]=='o')
				table[j][i][1]=table[j+1][i][1]+1;
			else 
				table[j][i][1]=0;
		}
	}

	FOR(j,0,R){
		FOR(i,0,C){
			flug=true;
			FOR(r,-K+1,K){
				if(i+r<0||i+r>C){
					flug=false;
					break;
				}
				if(table[j][i+r][0]<K-abs(r)||table[j][i+r][1]<K-abs(r)){
					flug=false;
					break;
				}
			}
			if(flug) counter+=1;
		}
	}
	cout<<counter<<endl;
	return 0;
}

Submission Info

Judge Result