답안 #93223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93223	2019-01-07T10:07:02 Z	Vardanyan	Bomb (IZhO17_bomb)	C++14	46 / 100	318 ms	104352 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 (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 (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 (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 });
				}
			}
		}
	}
	//	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;
		int b = M[a];
		a = min(a, mnh);
		//if (a > mnh) continue;
		a *= b;
		ans = max(ans, a);
	}
	cout << ans << endl;
	return 0;
}

Compilation message

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

Subtask #1

46.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	388 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	61 ms	47060 KB	Output is correct
4	Correct	41 ms	38840 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Incorrect	2 ms	504 KB	Output isn't correct
9	Incorrect	2 ms	632 KB	Output isn't correct
10	Correct	1 ms	504 KB	Output is correct
11	Incorrect	2 ms	548 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	Incorrect	2 ms	504 KB	Output isn't correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	2 ms	1144 KB	Output is correct
18	Correct	2 ms	1016 KB	Output is correct
19	Incorrect	2 ms	1272 KB	Output isn't correct
20	Incorrect	2 ms	1272 KB	Output isn't correct
21	Correct	2 ms	760 KB	Output is correct
22	Incorrect	2 ms	1020 KB	Output isn't correct
23	Incorrect	2 ms	1272 KB	Output isn't correct
24	Incorrect	2 ms	1144 KB	Output isn't correct
25	Incorrect	2 ms	1504 KB	Output isn't correct
26	Correct	10 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	9 ms	7032 KB	Output is correct
30	Incorrect	9 ms	5752 KB	Output isn't correct
31	Incorrect	7 ms	4344 KB	Output isn't correct
32	Incorrect	8 ms	5496 KB	Output isn't correct
33	Incorrect	9 ms	7032 KB	Output isn't correct
34	Incorrect	5 ms	2680 KB	Output isn't correct
35	Incorrect	8 ms	3704 KB	Output isn't correct
36	Correct	11 ms	8312 KB	Output is correct
37	Incorrect	2 ms	632 KB	Output isn't correct
38	Correct	200 ms	75388 KB	Output is correct
39	Correct	2 ms	632 KB	Output is correct
40	Incorrect	31 ms	20728 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	318 ms	104352 KB	Output is correct
44	Correct	11 ms	8312 KB	Output is correct
45	Correct	250 ms	89400 KB	Output is correct
46	Correct	207 ms	75484 KB	Output is correct
47	Correct	281 ms	89508 KB	Output is correct
48	Correct	246 ms	79592 KB	Output is correct
49	Correct	217 ms	75528 KB	Output is correct
50	Correct	241 ms	79592 KB	Output is correct
51	Correct	245 ms	79592 KB	Output is correct
52	Correct	247 ms	79540 KB	Output is correct
53	Correct	244 ms	79096 KB	Output is correct
54	Incorrect	225 ms	64236 KB	Output isn't correct
55	Incorrect	213 ms	62572 KB	Output isn't correct
56	Correct	221 ms	79636 KB	Output is correct
57	Incorrect	194 ms	56632 KB	Output isn't correct
58	Correct	208 ms	62636 KB	Output is correct
59	Correct	225 ms	58612 KB	Output is correct
60	Correct	197 ms	67448 KB	Output is correct
61	Correct	200 ms	75640 KB	Output is correct
62	Correct	206 ms	76152 KB	Output is correct
63	Correct	205 ms	76480 KB	Output is correct
64	Correct	192 ms	59384 KB	Output is correct
65	Correct	241 ms	79544 KB	Output is correct
66	Incorrect	203 ms	71772 KB	Output isn't correct
67	Correct	216 ms	80064 KB	Output is correct
68	Correct	228 ms	80148 KB	Output is correct
69	Incorrect	215 ms	56016 KB	Output isn't correct
70	Incorrect	137 ms	31480 KB	Output isn't correct
71	Incorrect	214 ms	47652 KB	Output isn't correct
72	Incorrect	200 ms	52132 KB	Output isn't correct
73	Incorrect	219 ms	52592 KB	Output isn't correct
74	Incorrect	216 ms	55544 KB	Output isn't correct
75	Incorrect	216 ms	57664 KB	Output isn't correct
76	Incorrect	220 ms	58728 KB	Output isn't correct
77	Incorrect	218 ms	59384 KB	Output isn't correct
78	Incorrect	214 ms	59700 KB	Output isn't correct
79	Incorrect	181 ms	32068 KB	Output isn't correct
80	Incorrect	220 ms	33528 KB	Output isn't correct
81	Incorrect	200 ms	33956 KB	Output isn't correct
82	Incorrect	201 ms	62200 KB	Output isn't correct
83	Incorrect	194 ms	61944 KB	Output isn't correct
84	Incorrect	199 ms	27056 KB	Output isn't correct
85	Incorrect	202 ms	60920 KB	Output isn't correct
86	Incorrect	220 ms	74412 KB	Output isn't correct
87	Incorrect	217 ms	59768 KB	Output isn't correct
88	Incorrect	212 ms	60804 KB	Output isn't correct
89	Incorrect	230 ms	69344 KB	Output isn't correct
90	Incorrect	152 ms	45376 KB	Output isn't correct
91	Incorrect	225 ms	64632 KB	Output isn't correct
92	Incorrect	220 ms	66296 KB	Output isn't correct
93	Incorrect	221 ms	73540 KB	Output isn't correct
94	Incorrect	226 ms	67772 KB	Output isn't correct
95	Incorrect	196 ms	61716 KB	Output isn't correct
96	Incorrect	201 ms	61432 KB	Output isn't correct
97	Incorrect	202 ms	73848 KB	Output isn't correct
98	Incorrect	197 ms	61176 KB	Output isn't correct
99	Incorrect	197 ms	67292 KB	Output isn't correct
100	Incorrect	216 ms	72652 KB	Output isn't correct