Submission #34543

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <queue>

#define rep2(i, b, n) for(int i=b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
#define sz(v) v.size()
#define mk(x, y) make_pair(x, y)
#define fst first
#define scd second
#define X fst
#define Y scd
#define MEMSET(x, n) memset(x, n, sizeof(x))
#define MEMZERO(x) MEMSET(x, 0)
#define URU(y) (!(y % 4) && y % 100 || !(y % 400))

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

string s[1001];

int dx[] = { 0, 0, -1, 1, -1, -1, 1, 1 };
int dy[] = { -1, 1, 0, 0, -1, 1, -1, 1 };

bool check( int n )
{
	int i = sqrt((double)n);
	return (i*i == n);
}

int main( void )
{
	int h, w;
	while(cin >> h >> w) {
		rep(i, h) cin >> s[i];
		int a, b, c;
		a = b = c = 0;
		rep(y, h) rep(x, w) {
			if(s[y][x] == 'o') {
				queue<pii> q;
				q.push(mk(x, y));
				s[y][x] = '.';
				int cnt = 0;
				while(!q.empty()) {
					pii p = q.front(); q.pop();
					++cnt;
					rep(d, 8) {
						int xx = p.X + dx[d], yy = p.Y + dy[d];
						if(0 <= xx && xx < w && 0 <= yy && yy < h
							&& s[yy][xx] == 'o'
						) {
							s[yy][xx] = '.';
							q.push(mk(xx, yy));
						}
					}
				}
				if(cnt % 12 == 0 && check(cnt / 12))
					++a;
				else if(cnt % 11 == 0 && check(cnt / 11))
					++c;
				else
					++b;
			}
		}
		cout << a << ' ' << b << ' ' << c << endl;
	}
	return 0;
}

Submission Info

Judge Result