Submission #91544

# Submission time Handle Problem Language Result Execution time Memory
91544 2018-12-28T08:46:50 Z davitmarg Bomb (IZhO17_bomb) C++17
18 / 100
934 ms 99072 KB
/*
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 (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 (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 (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 (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);
	}

	r = n;
	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

*/
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 20 ms 20552 KB Output is correct
4 Correct 20 ms 20552 KB Output is correct
5 Correct 2 ms 20552 KB Output is correct
6 Correct 2 ms 20552 KB Output is correct
7 Incorrect 2 ms 20552 KB Output isn't correct
8 Incorrect 2 ms 20552 KB Output isn't correct
9 Incorrect 2 ms 20552 KB Output isn't correct
10 Incorrect 2 ms 20552 KB Output isn't correct
11 Incorrect 2 ms 20552 KB Output isn't correct
12 Correct 2 ms 20552 KB Output is correct
13 Correct 2 ms 20552 KB Output is correct
14 Correct 2 ms 20552 KB Output is correct
15 Incorrect 2 ms 20552 KB Output isn't correct
16 Correct 2 ms 20552 KB Output is correct
17 Correct 3 ms 20552 KB Output is correct
18 Incorrect 3 ms 20552 KB Output isn't correct
19 Incorrect 3 ms 20552 KB Output isn't correct
20 Incorrect 3 ms 20552 KB Output isn't correct
21 Incorrect 2 ms 20552 KB Output isn't correct
22 Incorrect 2 ms 20552 KB Output isn't correct
23 Incorrect 3 ms 20552 KB Output isn't correct
24 Incorrect 2 ms 20552 KB Output isn't correct
25 Incorrect 3 ms 20552 KB Output isn't correct
26 Incorrect 3 ms 20552 KB Output isn't correct
27 Runtime error 16 ms 20552 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Incorrect 11 ms 20552 KB Output isn't correct
29 Incorrect 14 ms 20552 KB Output isn't correct
30 Incorrect 23 ms 20552 KB Output isn't correct
31 Incorrect 15 ms 20552 KB Output isn't correct
32 Incorrect 17 ms 20552 KB Output isn't correct
33 Incorrect 21 ms 20552 KB Output isn't correct
34 Incorrect 10 ms 20552 KB Output isn't correct
35 Incorrect 19 ms 20552 KB Output isn't correct
36 Incorrect 24 ms 20552 KB Output isn't correct
37 Correct 2 ms 20552 KB Output is correct
38 Correct 690 ms 52852 KB Output is correct
39 Correct 2 ms 52852 KB Output is correct
40 Incorrect 63 ms 52852 KB Output isn't correct
41 Incorrect 2 ms 52852 KB Output isn't correct
42 Incorrect 3 ms 52852 KB Output isn't correct
43 Correct 529 ms 52868 KB Output is correct
44 Incorrect 20 ms 52868 KB Output isn't correct
45 Incorrect 417 ms 52868 KB Output isn't correct
46 Correct 508 ms 52868 KB Output is correct
47 Incorrect 423 ms 52904 KB Output isn't correct
48 Incorrect 393 ms 52904 KB Output isn't correct
49 Incorrect 729 ms 53008 KB Output isn't correct
50 Incorrect 395 ms 53008 KB Output isn't correct
51 Incorrect 390 ms 53008 KB Output isn't correct
52 Incorrect 417 ms 53008 KB Output isn't correct
53 Incorrect 384 ms 53008 KB Output isn't correct
54 Incorrect 388 ms 53008 KB Output isn't correct
55 Incorrect 386 ms 53008 KB Output isn't correct
56 Correct 934 ms 53008 KB Output is correct
57 Incorrect 401 ms 53008 KB Output isn't correct
58 Incorrect 408 ms 53008 KB Output isn't correct
59 Incorrect 414 ms 53008 KB Output isn't correct
60 Runtime error 430 ms 98868 KB Execution killed with signal 11 (could be triggered by violating memory limits)
61 Incorrect 634 ms 98868 KB Output isn't correct
62 Incorrect 628 ms 98868 KB Output isn't correct
63 Incorrect 659 ms 98868 KB Output isn't correct
64 Incorrect 662 ms 98868 KB Output isn't correct
65 Incorrect 398 ms 98868 KB Output isn't correct
66 Incorrect 389 ms 98868 KB Output isn't correct
67 Incorrect 395 ms 98896 KB Output isn't correct
68 Incorrect 390 ms 98896 KB Output isn't correct
69 Incorrect 439 ms 98916 KB Output isn't correct
70 Incorrect 335 ms 98916 KB Output isn't correct
71 Incorrect 497 ms 98936 KB Output isn't correct
72 Incorrect 496 ms 98936 KB Output isn't correct
73 Incorrect 573 ms 98936 KB Output isn't correct
74 Incorrect 526 ms 98936 KB Output isn't correct
75 Incorrect 526 ms 98936 KB Output isn't correct
76 Incorrect 550 ms 98936 KB Output isn't correct
77 Incorrect 516 ms 98936 KB Output isn't correct
78 Incorrect 526 ms 98936 KB Output isn't correct
79 Incorrect 488 ms 98936 KB Output isn't correct
80 Incorrect 470 ms 98936 KB Output isn't correct
81 Incorrect 468 ms 98936 KB Output isn't correct
82 Incorrect 536 ms 98936 KB Output isn't correct
83 Incorrect 546 ms 98936 KB Output isn't correct
84 Incorrect 460 ms 98936 KB Output isn't correct
85 Incorrect 514 ms 98936 KB Output isn't correct
86 Incorrect 426 ms 98936 KB Output isn't correct
87 Correct 494 ms 98936 KB Output is correct
88 Incorrect 558 ms 98992 KB Output isn't correct
89 Incorrect 492 ms 98992 KB Output isn't correct
90 Incorrect 346 ms 98992 KB Output isn't correct
91 Incorrect 526 ms 98992 KB Output isn't correct
92 Incorrect 472 ms 98992 KB Output isn't correct
93 Incorrect 461 ms 98992 KB Output isn't correct
94 Incorrect 482 ms 98992 KB Output isn't correct
95 Incorrect 521 ms 98992 KB Output isn't correct
96 Incorrect 564 ms 98992 KB Output isn't correct
97 Incorrect 433 ms 98992 KB Output isn't correct
98 Incorrect 533 ms 98992 KB Output isn't correct
99 Incorrect 483 ms 99072 KB Output isn't correct
100 Incorrect 466 ms 99072 KB Output isn't correct