제출 #1106819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1106819		stdfloat	Bomb (IZhO17_bomb)	C++17	8 / 100	1086 ms	16032 KiB

bomb

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n, m;
	cin >> n >> m;

	vector<string> a(n);
	for (auto &i : a)
		cin >> i;

	int mn1 = n, mn2 = m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (a[i][j] == '0') continue;

			if (1 < (!i || a[i - 1][j] == '0') + (!j || a[i][j - 1] == '0') + (i + 1 == n || a[i + 1][j] == '0') + (j + 1 == m || a[i][j + 1] == '0')) {
				int l = i, r = i;
				while (0 < l && a[l - 1][j] == '1') l--;
				while (r + 1 < n && a[r + 1][j] == '1') r++;
				mn1 = min(mn1, max(r - i, i - l) + 1);
				
				l = r = j;
				while (0 < l && a[i][l - 1] == '1') l--;
				while (r + 1 < m && a[i][r + 1] == '1') r++;
				mn2 = min(mn2, max(r - j, j - l) + 1);
			}
		}
	}

	bool ok = true;
	vector<vector<bool>> vis(n, vector<bool>(m));
	for (int i = 0; i + mn1 <= n; i++) {
		for (int j = 0; j + mn2 <= m; j++) {
			if (a[i][j] == '0') continue;

			bool tr = true;
			for (int k = i; k < i + mn1 && tr; k++) {
				for (int l = j; l < j + mn2 && tr; l++)
					tr = (a[k][l] == '1');
			}

			ok = vis[i][j];
			if (!tr) continue;

			for (int k = i; k < i + mn1; k++) {
				for (int l = j; l < j + mn2; l++)
					vis[k][l] = true;
			}

			ok = true;
		}
	}

	for (int i = 0; i < n && ok; i++) {
		for (int j = 0; j < m && ok; j++)
			ok = (a[i][j] == '0' || vis[i][j]);
	}

	assert(ok);

	cout << mn1 * mn2;
}

• Subtask 1: 8 / 100