답안 #91546 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
91546	2018-12-28T09:26:24 Z	davitmarg	Bomb (IZhO17_bomb)	C++17	7 / 100	550 ms	49908 KB

bomb

/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#include <fstream>  
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;

int n, m,w,h,l,r,mid;
int mp[2503][2503],pr[2503][2503];
char tmp;

int sum(int ys,int xs,int y,int x)
{
	xs--;
	ys--;
	return pr[y][x] - pr[y][xs] - pr[ys][x] + pr[ys][xs];
}

bool check(int x)
{
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (mp[i][j] && !mp[i - 1][j] && !mp[i][j - 1])
			{
				int s = sum(i, j, i + x - 1, j + w - 1);
				if (i + x - 1 > n || j + w - 1 > m)
					return 0;
				if (s != x * w)
					return 0;
			}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (mp[i][j] && !mp[i + 1][j] && !mp[i][j + 1])
			{
				int s = sum(i-x+1,j-w+1,i, j);
				if (i - x + 1 < 1 || j - w + 1 < 1)
					return 0;
				if (s != x * w)
					return 0;
			}


	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (mp[i][j] && !mp[i - 1][j] && !mp[i][j + 1])
			{
				int s = sum(i, j - w + 1, i + x - 1, j);

				if (i + x - 1 > n || j - w + 1 < 1)
					return 0;
				if (s != x * w)
					return 0;
			}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (mp[i][j] && !mp[i + 1][j] && !mp[i][j - 1])
			{
				int s = sum(i - x + 1, j, i, j + w - 1);
				if (j + w - 1 > m || i - x + 1 < 1)
					return 0;
				if (s != x * w)
					return 0;
			}

	return 1;
}

int main()
{
	cin >> n >> m;
	w = m;
	h = n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
		{
			cin >> tmp;
			mp[i][j] = tmp - '0';
			pr[i][j] = pr[i - 1][j] + pr[i][j - 1] - pr[i - 1][j - 1]+mp[i][j];
		}
	for (int i = 1; i <= n; i++)
	{
		int sum = 0;
		for (int j = 1; j <= m; j++)
		{
			sum += mp[i][j];
			if (mp[i][j] == 0)
			{
				if (sum)
					w = min(sum,w);
				sum = 0;
			}
		}
		if(sum)
			w = min(sum, w);
	}

	for (int i = 0; i < m; i++)
	{

		int sum = 0;
		for (int j = 0; j < n; j++)
		{
			sum += mp[j][i];
			if (mp[j][i] == 0)
			{
				if (sum)
					r = min(sum, r);
				sum = 0;
			}
		}
		if (sum)
			r = min(sum, r);
	}

	l = 1;
	h = 1;
	while (l <= r)
	{
		mid = (l + r) / 2;
		if (check(mid))
		{
			h = mid;
			l = mid + 1;
		}
		else
			r = mid - 1;
	}

	cout << max(w * h,1) << endl;
	return 0;
}


/*



5 6
000000
111110
111111
111111
000000


7 8
01001110
01001110
01001100
00000000
01000000
01000000
01000000



7 8
01000000
00000000
00000000
00000000
00000000
00000000
00000000

7 8
11111111
11111111
11111111
11100111
11111111
11111111
11111111

7 8
00000000
00011000
00011000
00000000
00011111
00011111
00000000

*/

Subtask #1
7.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Incorrect	2 ms	596 KB	Output isn't correct
3	Incorrect	20 ms	20512 KB	Output isn't correct
4	Incorrect	20 ms	20560 KB	Output isn't correct
5	Correct	2 ms	20560 KB	Output is correct
6	Correct	2 ms	20560 KB	Output is correct
7	Incorrect	2 ms	20560 KB	Output isn't correct
8	Incorrect	2 ms	20560 KB	Output isn't correct
9	Incorrect	2 ms	20560 KB	Output isn't correct
10	Incorrect	2 ms	20560 KB	Output isn't correct
11	Incorrect	2 ms	20560 KB	Output isn't correct
12	Correct	2 ms	20560 KB	Output is correct
13	Correct	2 ms	20560 KB	Output is correct
14	Incorrect	2 ms	20560 KB	Output isn't correct
15	Incorrect	2 ms	20560 KB	Output isn't correct
16	Incorrect	2 ms	20560 KB	Output isn't correct
17	Incorrect	2 ms	20560 KB	Output isn't correct
18	Incorrect	3 ms	20560 KB	Output isn't correct
19	Incorrect	3 ms	20560 KB	Output isn't correct
20	Incorrect	3 ms	20560 KB	Output isn't correct
21	Incorrect	3 ms	20560 KB	Output isn't correct
22	Incorrect	3 ms	20560 KB	Output isn't correct
23	Incorrect	3 ms	20560 KB	Output isn't correct
24	Incorrect	2 ms	20560 KB	Output isn't correct
25	Incorrect	3 ms	20560 KB	Output isn't correct
26	Incorrect	3 ms	20560 KB	Output isn't correct
27	Correct	8 ms	20560 KB	Output is correct
28	Incorrect	10 ms	20560 KB	Output isn't correct
29	Incorrect	12 ms	20560 KB	Output isn't correct
30	Incorrect	16 ms	20560 KB	Output isn't correct
31	Incorrect	14 ms	20560 KB	Output isn't correct
32	Incorrect	14 ms	20560 KB	Output isn't correct
33	Incorrect	28 ms	20560 KB	Output isn't correct
34	Incorrect	9 ms	20560 KB	Output isn't correct
35	Incorrect	18 ms	20560 KB	Output isn't correct
36	Incorrect	17 ms	20560 KB	Output isn't correct
37	Incorrect	2 ms	20560 KB	Output isn't correct
38	Incorrect	390 ms	49616 KB	Output isn't correct
39	Incorrect	2 ms	49616 KB	Output isn't correct
40	Incorrect	54 ms	49616 KB	Output isn't correct
41	Incorrect	2 ms	49616 KB	Output isn't correct
42	Incorrect	3 ms	49616 KB	Output isn't correct
43	Incorrect	396 ms	49724 KB	Output isn't correct
44	Incorrect	17 ms	49724 KB	Output isn't correct
45	Incorrect	405 ms	49724 KB	Output isn't correct
46	Incorrect	394 ms	49724 KB	Output isn't correct
47	Incorrect	401 ms	49724 KB	Output isn't correct
48	Incorrect	398 ms	49724 KB	Output isn't correct
49	Incorrect	386 ms	49724 KB	Output isn't correct
50	Incorrect	395 ms	49724 KB	Output isn't correct
51	Incorrect	550 ms	49724 KB	Output isn't correct
52	Incorrect	396 ms	49724 KB	Output isn't correct
53	Incorrect	416 ms	49724 KB	Output isn't correct
54	Incorrect	423 ms	49724 KB	Output isn't correct
55	Incorrect	406 ms	49724 KB	Output isn't correct
56	Incorrect	404 ms	49724 KB	Output isn't correct
57	Incorrect	429 ms	49724 KB	Output isn't correct
58	Incorrect	421 ms	49724 KB	Output isn't correct
59	Incorrect	474 ms	49736 KB	Output isn't correct
60	Incorrect	419 ms	49736 KB	Output isn't correct
61	Incorrect	402 ms	49736 KB	Output isn't correct
62	Incorrect	409 ms	49736 KB	Output isn't correct
63	Incorrect	403 ms	49736 KB	Output isn't correct
64	Incorrect	426 ms	49736 KB	Output isn't correct
65	Incorrect	415 ms	49744 KB	Output isn't correct
66	Incorrect	417 ms	49744 KB	Output isn't correct
67	Incorrect	422 ms	49744 KB	Output isn't correct
68	Incorrect	412 ms	49744 KB	Output isn't correct
69	Incorrect	418 ms	49744 KB	Output isn't correct
70	Incorrect	279 ms	49744 KB	Output isn't correct
71	Incorrect	421 ms	49744 KB	Output isn't correct
72	Incorrect	421 ms	49744 KB	Output isn't correct
73	Incorrect	423 ms	49744 KB	Output isn't correct
74	Incorrect	424 ms	49744 KB	Output isn't correct
75	Incorrect	419 ms	49744 KB	Output isn't correct
76	Incorrect	418 ms	49744 KB	Output isn't correct
77	Incorrect	420 ms	49744 KB	Output isn't correct
78	Incorrect	429 ms	49744 KB	Output isn't correct
79	Incorrect	424 ms	49744 KB	Output isn't correct
80	Incorrect	417 ms	49812 KB	Output isn't correct
81	Incorrect	422 ms	49812 KB	Output isn't correct
82	Incorrect	417 ms	49812 KB	Output isn't correct
83	Incorrect	446 ms	49812 KB	Output isn't correct
84	Incorrect	418 ms	49812 KB	Output isn't correct
85	Incorrect	422 ms	49812 KB	Output isn't correct
86	Incorrect	409 ms	49812 KB	Output isn't correct
87	Correct	418 ms	49812 KB	Output is correct
88	Incorrect	416 ms	49812 KB	Output isn't correct
89	Incorrect	416 ms	49812 KB	Output isn't correct
90	Incorrect	280 ms	49812 KB	Output isn't correct
91	Incorrect	422 ms	49812 KB	Output isn't correct
92	Incorrect	416 ms	49812 KB	Output isn't correct
93	Incorrect	410 ms	49812 KB	Output isn't correct
94	Incorrect	416 ms	49812 KB	Output isn't correct
95	Incorrect	421 ms	49812 KB	Output isn't correct
96	Incorrect	422 ms	49812 KB	Output isn't correct
97	Incorrect	404 ms	49812 KB	Output isn't correct
98	Incorrect	421 ms	49908 KB	Output isn't correct
99	Incorrect	418 ms	49908 KB	Output isn't correct
100	Incorrect	386 ms	49908 KB	Output isn't correct

답안 #91546

Compilation message

Subtask #1 7.0 / 100.0

Subtask #1
7.0 / 100.0