답안 #93228

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93228	2019-01-07T10:16:20 Z	Vardanyan	Bomb (IZhO17_bomb)	C++11	70 / 100	240 ms	81224 KB

bomb

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <vector>
using namespace std;
const int N = 2505;
int dzaxic[N][N];
int ajic[N][N];
int a[N][N];
int n, m;
int M[N];

int mnw = 1000 * 1000 * 1000 + 5;
int mnh = mnw;
vector<pair<int, int> > v;
int main(){
	ios_base::sync_with_stdio(false);
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			char c;
			cin >> c;
			a[i][j] = c - '0';
		}
	}
	for (int i = 1; i <= n; i++)
	{
		int now = 0;
		for (int j = 1; j <= m; j++){
			if (a[i][j]){
				now++;
				dzaxic[i][j] = now;
			}
			else{
				if (now)	mnw = min(mnw, now);
				now = 0;
			}
		}
		if (now)	mnw = min(mnw, now);
		now = 0;
		for (int j = m; j >= 1; j--){
			if (a[i][j]){
				now++;
				ajic[i][j] = now;
			}
			else{
				if (now)	mnw = min(mnw, now);
				now = 0;
			}
		}
		if (now)	mnw = min(mnw, now);
		now = 0;
	}
	for (int j = 1; j <= m; j++){
		int now = 0;
		for (int i = 1; i <= n; i++){
			if (a[i][j]){
				now++;
			}
			else{
				if (now)	mnh = min(mnh, now);
				now = 0;
			}
		}
		if (now)	mnh = min(mnh, now);
	}
	//cout << mnh << " " << mnw << endl;
	/*for (int i = 1; i <= n; i++){
	for (int j = 1; j <= m; j++){
	cout <<ajic[i][j] << " ";
	}
	cout << endl;
	}*/
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			if (a[i][j] == 1 && a[i - 1][j] == 0 && a[i][j - 1] == 0 && a[i - 1][j - 1] == 0){
				int now = -1;
				//calc1(i, j, 1);
				for (int ii = i; ii <= n; ii++){
					if (a[ii][j] == 0) break;
					if (now == -1 || ajic[ii][j] < now){
						now = ajic[ii][j];
					}
					now = min(now, mnw);
					v.push_back({ ii - i + 1, now });
					if (ii - i + 1 >= mnh) break;
				}
			}
			if (a[i][j] == 1 && a[i][j - 1] == 0 && a[i + 1][j - 1] == 0 && a[i][j + 1] == 0){
				int now = -1;
				//calc1(i, j, -1);
				for (int ii = i; ii >= 1; ii--){
					if (a[ii][j] == 0) break;
					if (now == -1 || ajic[ii][j] < now){
						now = ajic[ii][j];
					}
					now = min(now, mnw);
					v.push_back({ i - ii + 1, now });
					if (i - ii + 1 >= mnh) break;
				}
			}
			if (a[i][j] == 1 && a[i - 1][j] == 0 && a[i][j + 1] == 0 && a[i - 1][j + 1] == 0){
				int now = -1;
				for (int ii = i; ii <= n; ii++){
					if (a[ii][j] == 0) break;
					if (now == -1 || dzaxic[ii][j] < now){
						now = dzaxic[ii][j];
					}
					now = min(now, mnw);
					v.push_back({ ii - i + 1, now });
					if (ii - i + 1 >= mnh) break;
				}
			}
			if (a[i][j] == 1 && a[i + 1][j] == 0 && a[i][j + 1] == 0 && a[i + 1][j + 1] == 0){
				int now = -1;
				for (int ii = i; ii >= 1; ii--){
					if (a[ii][j] == 0) break;
					if (now == -1 || dzaxic[ii][j] < now){
						now = dzaxic[ii][j];
					}
					now = min(now, mnw);
					v.push_back({ i - ii + 1, now });
					if (i - ii + 1 >= mnh) break;
				}
			}
		}
	}
	//	cout << mnh << " " << mnw << endl;
	memset(M, -1, sizeof M);
	for (int i = 0; i < v.size(); i++){
		int a = v[i].first;
		int b = v[i].second;
		b = min(b, mnw);
		if (M[a] == -1 || M[a] > b){
			M[a] = b;
		}
	}
	int ans = 0;
	for (int i = 0; i < v.size(); i++){
		int a = v[i].first;
		//a = min(a, mnh);
		//if (a > mnh) continue;
		int b = M[a];
		a *= b;
		ans = max(ans, a);
	}
	cout << ans << endl;
	return 0;
}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:132:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++){
                  ~~^~~~~~~~~~
bomb.cpp:141:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++){
                  ~~^~~~~~~~~~

Subtask #1

70.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	26 ms	31604 KB	Output is correct
4	Correct	26 ms	31604 KB	Output is correct
5	Correct	2 ms	380 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Incorrect	2 ms	632 KB	Output isn't correct
10	Correct	2 ms	508 KB	Output is correct
11	Incorrect	2 ms	508 KB	Output isn't correct
12	Correct	2 ms	504 KB	Output is correct
13	Correct	2 ms	504 KB	Output is correct
14	Correct	2 ms	504 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	2 ms	1272 KB	Output is correct
18	Correct	2 ms	1016 KB	Output is correct
19	Incorrect	2 ms	1272 KB	Output isn't correct
20	Correct	2 ms	1272 KB	Output is correct
21	Correct	2 ms	760 KB	Output is correct
22	Correct	2 ms	988 KB	Output is correct
23	Incorrect	2 ms	1272 KB	Output isn't correct
24	Incorrect	2 ms	1272 KB	Output isn't correct
25	Correct	2 ms	1528 KB	Output is correct
26	Correct	2 ms	1656 KB	Output is correct
27	Correct	6 ms	4856 KB	Output is correct
28	Correct	5 ms	2424 KB	Output is correct
29	Correct	8 ms	6648 KB	Output is correct
30	Incorrect	10 ms	5752 KB	Output isn't correct
31	Incorrect	8 ms	4344 KB	Output isn't correct
32	Incorrect	8 ms	5496 KB	Output isn't correct
33	Correct	10 ms	6908 KB	Output is correct
34	Correct	5 ms	2680 KB	Output is correct
35	Incorrect	8 ms	3704 KB	Output isn't correct
36	Correct	10 ms	8312 KB	Output is correct
37	Correct	2 ms	632 KB	Output is correct
38	Correct	202 ms	75200 KB	Output is correct
39	Correct	2 ms	632 KB	Output is correct
40	Incorrect	31 ms	20344 KB	Output isn't correct
41	Correct	2 ms	632 KB	Output is correct
42	Correct	3 ms	1656 KB	Output is correct
43	Correct	240 ms	79748 KB	Output is correct
44	Correct	12 ms	8056 KB	Output is correct
45	Correct	234 ms	81144 KB	Output is correct
46	Correct	209 ms	75520 KB	Output is correct
47	Correct	237 ms	81224 KB	Output is correct
48	Correct	228 ms	76024 KB	Output is correct
49	Correct	223 ms	75256 KB	Output is correct
50	Correct	207 ms	75872 KB	Output is correct
51	Correct	215 ms	76024 KB	Output is correct
52	Correct	238 ms	75640 KB	Output is correct
53	Correct	220 ms	75052 KB	Output is correct
54	Correct	196 ms	62584 KB	Output is correct
55	Correct	194 ms	60788 KB	Output is correct
56	Correct	236 ms	79564 KB	Output is correct
57	Correct	211 ms	55620 KB	Output is correct
58	Correct	220 ms	60920 KB	Output is correct
59	Correct	195 ms	57976 KB	Output is correct
60	Correct	228 ms	67036 KB	Output is correct
61	Correct	226 ms	75256 KB	Output is correct
62	Correct	203 ms	75384 KB	Output is correct
63	Correct	202 ms	75308 KB	Output is correct
64	Correct	218 ms	58172 KB	Output is correct
65	Correct	228 ms	74624 KB	Output is correct
66	Correct	207 ms	71108 KB	Output is correct
67	Correct	236 ms	75768 KB	Output is correct
68	Correct	231 ms	75868 KB	Output is correct
69	Correct	221 ms	55196 KB	Output is correct
70	Incorrect	139 ms	31352 KB	Output isn't correct
71	Incorrect	209 ms	47664 KB	Output isn't correct
72	Correct	195 ms	52072 KB	Output is correct
73	Incorrect	194 ms	52536 KB	Output isn't correct
74	Incorrect	199 ms	55416 KB	Output isn't correct
75	Incorrect	192 ms	56960 KB	Output isn't correct
76	Correct	218 ms	58488 KB	Output is correct
77	Correct	221 ms	58816 KB	Output is correct
78	Correct	199 ms	59128 KB	Output is correct
79	Incorrect	177 ms	31496 KB	Output isn't correct
80	Incorrect	179 ms	32884 KB	Output isn't correct
81	Incorrect	178 ms	33364 KB	Output isn't correct
82	Correct	201 ms	61684 KB	Output is correct
83	Incorrect	198 ms	61688 KB	Output isn't correct
84	Incorrect	174 ms	26736 KB	Output isn't correct
85	Incorrect	195 ms	60652 KB	Output isn't correct
86	Incorrect	205 ms	74252 KB	Output isn't correct
87	Correct	209 ms	59584 KB	Output is correct
88	Incorrect	200 ms	60716 KB	Output isn't correct
89	Incorrect	201 ms	69428 KB	Output isn't correct
90	Incorrect	129 ms	45688 KB	Output isn't correct
91	Correct	198 ms	64692 KB	Output is correct
92	Correct	201 ms	66388 KB	Output is correct
93	Correct	198 ms	73412 KB	Output is correct
94	Incorrect	209 ms	67704 KB	Output isn't correct
95	Incorrect	201 ms	61612 KB	Output isn't correct
96	Incorrect	228 ms	61176 KB	Output isn't correct
97	Correct	203 ms	73720 KB	Output is correct
98	Correct	198 ms	61064 KB	Output is correct
99	Incorrect	213 ms	67292 KB	Output isn't correct
100	Incorrect	199 ms	72440 KB	Output isn't correct