답안 #697241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
697241	2023-02-09T00:22:55 Z	allllekssssa	Bomb (IZhO17_bomb)	C++14	51 / 100	1000 ms	77448 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 = minW * minH;
    if (!check(minW, minH)) 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	23 ms	30412 KB	Output is correct
4	Correct	24 ms	30376 KB	Output is correct
5	Correct	37 ms	340 KB	Output is correct
6	Correct	8 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	1 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	436 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	1468 KB	Output is correct
20	Correct	6 ms	1524 KB	Output is correct
21	Correct	4 ms	980 KB	Output is correct
22	Correct	5 ms	1236 KB	Output is correct
23	Correct	9 ms	1728 KB	Output is correct
24	Correct	4 ms	1364 KB	Output is correct
25	Correct	9 ms	1620 KB	Output is correct
26	Correct	8 ms	1640 KB	Output is correct
27	Correct	125 ms	4852 KB	Output is correct
28	Correct	245 ms	5180 KB	Output is correct
29	Correct	344 ms	6584 KB	Output is correct
30	Correct	620 ms	7868 KB	Output is correct
31	Correct	505 ms	6224 KB	Output is correct
32	Correct	523 ms	7152 KB	Output is correct
33	Correct	765 ms	8284 KB	Output is correct
34	Correct	118 ms	5596 KB	Output is correct
35	Correct	619 ms	8280 KB	Output is correct
36	Correct	690 ms	8284 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	270 ms	77256 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Incorrect	34 ms	20124 KB	Output isn't correct
41	Correct	1 ms	564 KB	Output is correct
42	Correct	11 ms	1620 KB	Output is correct
43	Correct	284 ms	77448 KB	Output is correct
44	Correct	951 ms	8320 KB	Output is correct
45	Incorrect	254 ms	77288 KB	Output isn't correct
46	Correct	270 ms	76600 KB	Output is correct
47	Incorrect	259 ms	76576 KB	Output isn't correct
48	Incorrect	259 ms	76524 KB	Output isn't correct
49	Correct	279 ms	76628 KB	Output is correct
50	Incorrect	254 ms	76548 KB	Output isn't correct
51	Incorrect	255 ms	76532 KB	Output isn't correct
52	Incorrect	261 ms	76572 KB	Output isn't correct
53	Incorrect	249 ms	76620 KB	Output isn't correct
54	Incorrect	254 ms	76616 KB	Output isn't correct
55	Incorrect	262 ms	76616 KB	Output isn't correct
56	Correct	276 ms	76628 KB	Output is correct
57	Incorrect	273 ms	76524 KB	Output isn't correct
58	Incorrect	263 ms	76728 KB	Output isn't correct
59	Incorrect	265 ms	76628 KB	Output isn't correct
60	Correct	273 ms	76600 KB	Output is correct
61	Correct	286 ms	76628 KB	Output is correct
62	Correct	284 ms	76740 KB	Output is correct
63	Correct	272 ms	76576 KB	Output is correct
64	Correct	263 ms	76628 KB	Output is correct
65	Incorrect	258 ms	76680 KB	Output isn't correct
66	Incorrect	255 ms	76564 KB	Output isn't correct
67	Incorrect	255 ms	76620 KB	Output isn't correct
68	Incorrect	263 ms	76532 KB	Output isn't correct
69	Incorrect	274 ms	76528 KB	Output isn't correct
70	Execution timed out	1093 ms	61332 KB	Time limit exceeded
71	Incorrect	257 ms	76648 KB	Output isn't correct
72	Incorrect	253 ms	76624 KB	Output isn't correct
73	Incorrect	251 ms	76628 KB	Output isn't correct
74	Incorrect	284 ms	76600 KB	Output isn't correct
75	Incorrect	258 ms	76524 KB	Output isn't correct
76	Incorrect	254 ms	76532 KB	Output isn't correct
77	Incorrect	274 ms	76628 KB	Output isn't correct
78	Incorrect	263 ms	76624 KB	Output isn't correct
79	Incorrect	264 ms	76628 KB	Output isn't correct
80	Incorrect	271 ms	76592 KB	Output isn't correct
81	Incorrect	251 ms	76580 KB	Output isn't correct
82	Incorrect	273 ms	76772 KB	Output isn't correct
83	Incorrect	260 ms	76620 KB	Output isn't correct
84	Incorrect	255 ms	76628 KB	Output isn't correct
85	Incorrect	258 ms	76620 KB	Output isn't correct
86	Incorrect	251 ms	76512 KB	Output isn't correct
87	Incorrect	257 ms	76548 KB	Output isn't correct
88	Incorrect	293 ms	76576 KB	Output isn't correct
89	Incorrect	247 ms	76604 KB	Output isn't correct
90	Execution timed out	1098 ms	61356 KB	Time limit exceeded
91	Incorrect	249 ms	76608 KB	Output isn't correct
92	Incorrect	255 ms	76524 KB	Output isn't correct
93	Incorrect	255 ms	76592 KB	Output isn't correct
94	Incorrect	252 ms	76552 KB	Output isn't correct
95	Incorrect	254 ms	76624 KB	Output isn't correct
96	Incorrect	264 ms	76624 KB	Output isn't correct
97	Incorrect	255 ms	76624 KB	Output isn't correct
98	Incorrect	281 ms	76616 KB	Output isn't correct
99	Incorrect	255 ms	76528 KB	Output isn't correct
100	Incorrect	252 ms	76612 KB	Output isn't correct