Submission #34388

---

Source Code Expand

#include <iostream>
using namespace std;

int h,w;
char c[1100][1100];

int di[8] = {-1,-1,-1, 0, 0,  1,1,1};
int dj[8] = {-1, 0, 1, 1,-1, -1,0,1};

int d(int i,int j ){
  if( i<0 || i>=h ) return 0;
  if( j<0 || j>=w ) return 0;
  if( c[i][j]=='.' ) return 0;

  c[i][j]='.';
  int rtn = 1;
  for( int l=0;l<8;l++ )
    rtn += d( i+di[l], j+dj[l] );
  return rtn;
}

int gcd(int a, int b){
  if( b==0 ) return a;
  return gcd(b,a%b);
}

int main(){
  cin >> h >> w;
  for( int i=0;i<h;i++ )
    for( int j=0;j<w;j++ )
      cin >> c[i][j];

  int an=0, bn=0, cn=0;
  for( int i=0;i<h;i++ ){
    for( int j=0;j<w;j++ ){
      if( c[i][j]=='o' ){
	int nb = d(i,j);
	bool fa=true, fb=true, fc=false;
	for( int k=1; (fa&&fb) || (fb&&fc) || (fc&&fa);k++ ){
	  int z = nb / (k*k);
	  fa = z%12==0;
	  fb = z%16==0;
	  fc = z%11==0;

	  if( !fa && !fb && !fc )
	    continue;
	}
	if( fa ) an++;
	else if( fb ) bn++;
	else if( fc ) cn++;
      }
    }
  }
  cout << an << " " << bn << " " << cn << endl;

  return 0;
}

Submission Info

Judge Result