oj.uz

Submission #697237

# Submission time Handle Problem Language Result Execution time Memory
697237 2023-02-09T00:18:02 Z allllekssssa Bomb (IZhO17_bomb) C++14
51 / 100
 1000 ms 76776 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
const int maxN = 2600;
int n, m;
int a[maxN][maxN];
int d[maxN][maxN];
int c[maxN][maxN];
string s;
 
int getDSum(int x1, int y1, int x2, int y2) {
	if (x2 > n || y2 > m) return 0;
	return d[x2][y2] + d[x1 - 1][y1 - 1] - d[x1 - 1][y2] - d[x2][y1 - 1];
}
 
int getCSum(int x1, int y1, int x2, int y2) {
	x1 = max(x1, 1);
	y1 = max(y1, 1);
	return c[x2][y2] + c[x1 - 1][y1 - 1] - c[x1 - 1][y2] - c[x2][y1 - 1];
}
 
bool check(int x, int y) {
 
	for (int i = 1; i<=n; i++) {
		for (int j = 1; j<=m; j++) {
			c[i][j] = 0;
		}
	}
   
   for (int i = 1; i<=n; i++) {
   	 for (int j = 1; j<=m; j++) {
   	 	if (getDSum(i, j, i + x - 1, j + y - 1) == x * y) c[i][j] = 1;
   	 }
   }
 
   for (int i = 1; i <= n; i++) {
		for (int j = 1; j<=m; j++) {
			c[i][j] += c[i - 1][j] + c[i][j - 1] - c[i - 1][j - 1];
		}
	}
 
   for (int i = 1; i<=n; i++) {
   	for (int j = 1; j <= m; j++) {
 		  if (a[i][j] && getCSum(i - x + 1, j - y + 1, i, j) == 0) return false;
   	  }
   }
 
   return true;
}
 
int heuristic() {
  
   int minW = n;
   int minH = m;

	for (int i = 1; i<=n; i++) {
		int cur = 0;
		for (int j = 1; j<=m; j++) {
			if (a[i][j] == 1) cur++; else {
				if (cur > 0) {
					minH = min(minH, cur);
					cur = 0;
				}
			}
		}

	   if (cur > 0) minH = min(minH, cur);
	}

	for (int j = 1; j<=m; j++) {
		int cur = 0;
		for (int i = 1; i<=n; i++) {
			if (a[i][j] == 1) cur++; else {
				if (cur > 0) {
					minW = min(minW, cur);
					cur = 0;
				}
			}
		}

		if (cur > 0) minW = min(minW, cur);
	}
    
    int ans = 0;
	for (int i = 0; i< min(2, minW); i++) {
		for (int j = 0; j<min(2, minH); j++) {
           if (check(minW - i, minH -j)) ans = max(ans, (minW - i) * (minH -j));
		}
	}

	if (ans == 0) ans = 2;
	return ans;
}

int main() {
 
	cin >> n >> m;
 
	for (int i = 1; i <=n; i++) {
		cin >> s;
 
		for (int j = 0; j < m; j++) {
			a[i][j + 1] = s[j] - '0';
		}
	}
    
    for (int i = 1; i <= n; i++) {
		for (int j = 1; j<=m; j++) {
			d[i][j] = d[i - 1][j] + d[i][j - 1] + a[i][j] - d[i - 1][j - 1];
		}
	}

	if (n * m  * (n + m) >= 3e8) {
		cout << heuristic() << endl;
		return 0;
	}

   
    int ans = 0;
    
    int width = m;
	for (int i = 1; i <=n; i++) {
 
		while (width > 0 && !check(i, width)) width--;
 
		ans = max(ans, i * width);
	}
    
    cout << ans << endl;
}

Subtask #1
51.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 19 ms 30352 KB Output is correct
4 Correct 19 ms 30444 KB Output is correct
5 Correct 36 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 3 ms 1108 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 5 ms 1492 KB Output is correct
20 Correct 6 ms 1620 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 5 ms 1236 KB Output is correct
23 Correct 9 ms 1628 KB Output is correct
24 Correct 4 ms 1364 KB Output is correct
25 Correct 10 ms 1636 KB Output is correct
26 Correct 8 ms 1620 KB Output is correct
27 Correct 128 ms 4768 KB Output is correct
28 Correct 270 ms 5076 KB Output is correct
29 Correct 320 ms 6448 KB Output is correct
30 Correct 670 ms 7684 KB Output is correct
31 Correct 477 ms 6076 KB Output is correct
32 Correct 480 ms 6996 KB Output is correct
33 Correct 767 ms 8084 KB Output is correct
34 Correct 113 ms 5460 KB Output is correct
35 Correct 561 ms 8080 KB Output is correct
36 Correct 663 ms 8084 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 429 ms 76648 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Incorrect 48 ms 19796 KB Output isn't correct
41 Correct 0 ms 468 KB Output is correct
42 Correct 11 ms 1632 KB Output is correct
43 Correct 439 ms 76668 KB Output is correct
44 Correct 933 ms 8084 KB Output is correct
45 Incorrect 357 ms 76624 KB Output isn't correct
46 Correct 489 ms 76672 KB Output is correct
47 Incorrect 363 ms 76632 KB Output isn't correct
48 Incorrect 388 ms 76552 KB Output isn't correct
49 Correct 440 ms 76524 KB Output is correct
50 Incorrect 375 ms 76680 KB Output isn't correct
51 Incorrect 369 ms 76724 KB Output isn't correct
52 Incorrect 370 ms 76592 KB Output isn't correct
53 Incorrect 373 ms 76624 KB Output isn't correct
54 Incorrect 371 ms 76708 KB Output isn't correct
55 Incorrect 380 ms 76620 KB Output isn't correct
56 Correct 438 ms 76748 KB Output is correct
57 Incorrect 395 ms 76628 KB Output isn't correct
58 Incorrect 390 ms 76628 KB Output isn't correct
59 Incorrect 385 ms 76628 KB Output isn't correct
60 Correct 428 ms 76676 KB Output is correct
61 Correct 438 ms 76620 KB Output is correct
62 Correct 435 ms 76624 KB Output is correct
63 Correct 426 ms 76632 KB Output is correct
64 Correct 403 ms 76724 KB Output is correct
65 Incorrect 390 ms 76632 KB Output isn't correct
66 Incorrect 372 ms 76624 KB Output isn't correct
67 Incorrect 369 ms 76528 KB Output isn't correct
68 Incorrect 378 ms 76600 KB Output isn't correct
69 Incorrect 392 ms 76528 KB Output isn't correct
70 Execution timed out 1083 ms 61244 KB Time limit exceeded
71 Incorrect 379 ms 76624 KB Output isn't correct
72 Incorrect 373 ms 76628 KB Output isn't correct
73 Incorrect 369 ms 76708 KB Output isn't correct
74 Incorrect 390 ms 76700 KB Output isn't correct
75 Incorrect 364 ms 76564 KB Output isn't correct
76 Incorrect 367 ms 76552 KB Output isn't correct
77 Incorrect 377 ms 76508 KB Output isn't correct
78 Incorrect 370 ms 76552 KB Output isn't correct
79 Incorrect 364 ms 76632 KB Output isn't correct
80 Incorrect 379 ms 76636 KB Output isn't correct
81 Incorrect 367 ms 76628 KB Output isn't correct
82 Incorrect 367 ms 76552 KB Output isn't correct
83 Incorrect 382 ms 76776 KB Output isn't correct
84 Incorrect 360 ms 76624 KB Output isn't correct
85 Incorrect 372 ms 76608 KB Output isn't correct
86 Incorrect 372 ms 76636 KB Output isn't correct
87 Incorrect 368 ms 76632 KB Output isn't correct
88 Incorrect 361 ms 76544 KB Output isn't correct
89 Incorrect 370 ms 76652 KB Output isn't correct
90 Execution timed out 1091 ms 61388 KB Time limit exceeded
91 Incorrect 369 ms 76532 KB Output isn't correct
92 Incorrect 371 ms 76652 KB Output isn't correct
93 Incorrect 364 ms 76628 KB Output isn't correct
94 Incorrect 376 ms 76624 KB Output isn't correct
95 Incorrect 370 ms 76612 KB Output isn't correct
96 Incorrect 382 ms 76736 KB Output isn't correct
97 Incorrect 365 ms 76604 KB Output isn't correct
98 Incorrect 373 ms 76704 KB Output isn't correct
99 Incorrect 364 ms 76564 KB Output isn't correct
100 Incorrect 384 ms 76624 KB Output isn't correct