답안 #697233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
697233	2023-02-09T00:12:19 Z	allllekssssa	Bomb (IZhO17_bomb)	C++14	43 / 100	470 ms	76748 KB

bomb

#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));
		}
	}
	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 (1ll * n * m * (n + m) >= 70000000) {
		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

43.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	18 ms	30444 KB	Output is correct
4	Correct	23 ms	30420 KB	Output is correct
5	Correct	39 ms	340 KB	Output is correct
6	Correct	6 ms	340 KB	Output is correct
7	Correct	0 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	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	0 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	2 ms	1108 KB	Output is correct
19	Correct	5 ms	1532 KB	Output is correct
20	Correct	6 ms	1492 KB	Output is correct
21	Correct	4 ms	980 KB	Output is correct
22	Correct	5 ms	1236 KB	Output is correct
23	Correct	8 ms	1620 KB	Output is correct
24	Correct	4 ms	1364 KB	Output is correct
25	Correct	10 ms	1632 KB	Output is correct
26	Correct	8 ms	1620 KB	Output is correct
27	Correct	147 ms	4684 KB	Output is correct
28	Incorrect	9 ms	5076 KB	Output isn't correct
29	Incorrect	12 ms	6360 KB	Output isn't correct
30	Incorrect	12 ms	7616 KB	Output isn't correct
31	Incorrect	11 ms	6092 KB	Output isn't correct
32	Incorrect	11 ms	7012 KB	Output isn't correct
33	Incorrect	13 ms	8064 KB	Output isn't correct
34	Correct	122 ms	5516 KB	Output is correct
35	Incorrect	15 ms	8060 KB	Output isn't correct
36	Correct	16 ms	8044 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	424 ms	76616 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Incorrect	51 ms	19868 KB	Output isn't correct
41	Correct	1 ms	548 KB	Output is correct
42	Correct	11 ms	1620 KB	Output is correct
43	Correct	449 ms	76628 KB	Output is correct
44	Incorrect	13 ms	8020 KB	Output isn't correct
45	Incorrect	360 ms	76748 KB	Output isn't correct
46	Correct	452 ms	76628 KB	Output is correct
47	Incorrect	370 ms	76720 KB	Output isn't correct
48	Incorrect	366 ms	76520 KB	Output isn't correct
49	Correct	442 ms	76708 KB	Output is correct
50	Incorrect	367 ms	76620 KB	Output isn't correct
51	Incorrect	379 ms	76596 KB	Output isn't correct
52	Incorrect	359 ms	76628 KB	Output isn't correct
53	Incorrect	381 ms	76732 KB	Output isn't correct
54	Incorrect	371 ms	76616 KB	Output isn't correct
55	Incorrect	375 ms	76644 KB	Output isn't correct
56	Correct	437 ms	76540 KB	Output is correct
57	Incorrect	401 ms	76532 KB	Output isn't correct
58	Incorrect	395 ms	76564 KB	Output isn't correct
59	Incorrect	423 ms	76712 KB	Output isn't correct
60	Correct	415 ms	76624 KB	Output is correct
61	Correct	463 ms	76700 KB	Output is correct
62	Correct	432 ms	76628 KB	Output is correct
63	Correct	470 ms	76720 KB	Output is correct
64	Correct	403 ms	76632 KB	Output is correct
65	Incorrect	368 ms	76748 KB	Output isn't correct
66	Incorrect	375 ms	76624 KB	Output isn't correct
67	Incorrect	373 ms	76624 KB	Output isn't correct
68	Incorrect	373 ms	76632 KB	Output isn't correct
69	Incorrect	391 ms	76604 KB	Output isn't correct
70	Incorrect	237 ms	61344 KB	Output isn't correct
71	Incorrect	367 ms	76716 KB	Output isn't correct
72	Incorrect	367 ms	76516 KB	Output isn't correct
73	Incorrect	368 ms	76704 KB	Output isn't correct
74	Incorrect	385 ms	76632 KB	Output isn't correct
75	Incorrect	382 ms	76700 KB	Output isn't correct
76	Incorrect	379 ms	76564 KB	Output isn't correct
77	Incorrect	379 ms	76628 KB	Output isn't correct
78	Incorrect	378 ms	76624 KB	Output isn't correct
79	Incorrect	368 ms	76636 KB	Output isn't correct
80	Incorrect	373 ms	76524 KB	Output isn't correct
81	Incorrect	373 ms	76628 KB	Output isn't correct
82	Incorrect	367 ms	76632 KB	Output isn't correct
83	Incorrect	378 ms	76704 KB	Output isn't correct
84	Incorrect	375 ms	76652 KB	Output isn't correct
85	Incorrect	368 ms	76748 KB	Output isn't correct
86	Incorrect	366 ms	76528 KB	Output isn't correct
87	Incorrect	380 ms	76548 KB	Output isn't correct
88	Incorrect	375 ms	76628 KB	Output isn't correct
89	Incorrect	367 ms	76620 KB	Output isn't correct
90	Incorrect	244 ms	61388 KB	Output isn't correct
91	Incorrect	372 ms	76628 KB	Output isn't correct
92	Incorrect	380 ms	76648 KB	Output isn't correct
93	Incorrect	381 ms	76628 KB	Output isn't correct
94	Incorrect	380 ms	76628 KB	Output isn't correct
95	Incorrect	367 ms	76504 KB	Output isn't correct
96	Incorrect	365 ms	76728 KB	Output isn't correct
97	Incorrect	366 ms	76616 KB	Output isn't correct
98	Incorrect	372 ms	76628 KB	Output isn't correct
99	Incorrect	380 ms	76540 KB	Output isn't correct
100	Incorrect	385 ms	76628 KB	Output isn't correct