Submission #1275713

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deque>

using namespace std;

#define mod 1000000007

int main()
{
	int h, w;
	cin >> h >> w;
	char s[105][105];
	for(int i = 1; i <= h; i++){
		for(int j = 1; j <= w; j++){
			cin >> s[i][j];
		}
	}
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			if(s[i][j] == 'X'){
				if(i == 0 || j == 0 || i == h - 1 || j == w - 1){
					cout << -1 << endl;
					return 0;
				}
				s[i - 1][j] = '#';
				s[i][j - 1] = '#';
				s[i + 1][j] = '#';
				s[i][j + 1] = '#';
			}
		}
	}
	vector<vector<bool> > ischecked(105, vector<bool>(105, false));
	int dx[4] = {0, 1, 0, -1};
	int dy[4] = {1, 0, -1, 0};
	int ans = 0;
	ischecked[0][0] = true;
	queue<pair<int, int> > qu;
	qu.push(make_pair(0, 0));
	while(!qu.empty()){
		int x = (qu.front()).first;
		int y = (qu.front()).second;
		qu.pop();
		for(int k = 0; k < 4; k++){
			int nx = x + dx[k];
			int ny = y + dy[k];
			if(nx < 0 || ny < 0 || nx > h + 1 || ny > w + 1 || ischecked[nx][ny]) continue;
			ischecked[nx][ny] = true;
			if(s[nx][ny] == '#') ans++;
			else if(s[nx][ny] == '.') qu.push(make_pair(nx, ny));
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result