Submission #697242

# Submission time Handle Problem Language Result Execution time Memory
697242 2023-02-09T00:23:52 Z allllekssssa Bomb (IZhO17_bomb) C++14
51 / 100
1000 ms 76748 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 = minW * minH;
    if (!check(minW, minH)) ans--; 
	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;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 19 ms 30420 KB Output is correct
4 Correct 20 ms 30400 KB Output is correct
5 Correct 37 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 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 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 4 ms 1156 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 1512 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 6 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 9 ms 1628 KB Output is correct
26 Correct 8 ms 1620 KB Output is correct
27 Correct 126 ms 4692 KB Output is correct
28 Correct 239 ms 5076 KB Output is correct
29 Correct 339 ms 6456 KB Output is correct
30 Correct 615 ms 7684 KB Output is correct
31 Correct 509 ms 6072 KB Output is correct
32 Correct 477 ms 7116 KB Output is correct
33 Correct 741 ms 8088 KB Output is correct
34 Correct 114 ms 5460 KB Output is correct
35 Correct 547 ms 8088 KB Output is correct
36 Correct 654 ms 8080 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 272 ms 76592 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Incorrect 32 ms 19872 KB Output isn't correct
41 Correct 0 ms 468 KB Output is correct
42 Correct 11 ms 1620 KB Output is correct
43 Correct 264 ms 76544 KB Output is correct
44 Correct 906 ms 8088 KB Output is correct
45 Incorrect 260 ms 76620 KB Output isn't correct
46 Correct 284 ms 76520 KB Output is correct
47 Incorrect 251 ms 76624 KB Output isn't correct
48 Incorrect 257 ms 76628 KB Output isn't correct
49 Correct 277 ms 76620 KB Output is correct
50 Incorrect 260 ms 76612 KB Output isn't correct
51 Incorrect 254 ms 76620 KB Output isn't correct
52 Incorrect 252 ms 76584 KB Output isn't correct
53 Incorrect 260 ms 76524 KB Output isn't correct
54 Incorrect 258 ms 76524 KB Output isn't correct
55 Incorrect 261 ms 76608 KB Output isn't correct
56 Correct 267 ms 76616 KB Output is correct
57 Incorrect 268 ms 76620 KB Output isn't correct
58 Incorrect 264 ms 76692 KB Output isn't correct
59 Incorrect 287 ms 76544 KB Output isn't correct
60 Correct 268 ms 76572 KB Output is correct
61 Correct 283 ms 76632 KB Output is correct
62 Correct 276 ms 76544 KB Output is correct
63 Correct 273 ms 76528 KB Output is correct
64 Correct 264 ms 76652 KB Output is correct
65 Incorrect 273 ms 76604 KB Output isn't correct
66 Incorrect 257 ms 76528 KB Output isn't correct
67 Incorrect 262 ms 76528 KB Output isn't correct
68 Incorrect 275 ms 76576 KB Output isn't correct
69 Incorrect 276 ms 76628 KB Output isn't correct
70 Execution timed out 1096 ms 61260 KB Time limit exceeded
71 Incorrect 259 ms 76624 KB Output isn't correct
72 Incorrect 260 ms 76524 KB Output isn't correct
73 Incorrect 294 ms 76620 KB Output isn't correct
74 Incorrect 255 ms 76572 KB Output isn't correct
75 Incorrect 262 ms 76748 KB Output isn't correct
76 Incorrect 263 ms 76628 KB Output isn't correct
77 Incorrect 261 ms 76580 KB Output isn't correct
78 Incorrect 264 ms 76632 KB Output isn't correct
79 Incorrect 258 ms 76572 KB Output isn't correct
80 Incorrect 264 ms 76620 KB Output isn't correct
81 Incorrect 267 ms 76520 KB Output isn't correct
82 Incorrect 274 ms 76528 KB Output isn't correct
83 Incorrect 256 ms 76536 KB Output isn't correct
84 Incorrect 280 ms 76624 KB Output isn't correct
85 Incorrect 253 ms 76524 KB Output isn't correct
86 Incorrect 258 ms 76620 KB Output isn't correct
87 Incorrect 270 ms 76624 KB Output isn't correct
88 Incorrect 252 ms 76720 KB Output isn't correct
89 Incorrect 256 ms 76576 KB Output isn't correct
90 Execution timed out 1081 ms 61328 KB Time limit exceeded
91 Incorrect 262 ms 76624 KB Output isn't correct
92 Incorrect 260 ms 76532 KB Output isn't correct
93 Incorrect 251 ms 76640 KB Output isn't correct
94 Incorrect 250 ms 76628 KB Output isn't correct
95 Incorrect 257 ms 76668 KB Output isn't correct
96 Incorrect 255 ms 76528 KB Output isn't correct
97 Incorrect 254 ms 76620 KB Output isn't correct
98 Incorrect 257 ms 76632 KB Output isn't correct
99 Incorrect 253 ms 76628 KB Output isn't correct
100 Incorrect 259 ms 76672 KB Output isn't correct