oj.uz

Submission #93222

# Submission time Handle Problem Language Result Execution time Memory
93222 2019-01-07T10:05:40 Z Vardanyan Bomb (IZhO17_bomb) C++14
70 / 100
 319 ms 107548 KB 
#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;
		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: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
70.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 63 ms 46932 KB Output is correct
4 Correct 41 ms 38780 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 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 504 KB Output is correct
11 Incorrect 2 ms 632 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 604 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 1016 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 3 ms 1528 KB Output is correct
26 Correct 3 ms 1656 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 5 ms 2424 KB Output is correct
29 Correct 9 ms 7160 KB Output is correct
30 Incorrect 9 ms 5724 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 Correct 10 ms 6904 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 223 ms 78712 KB Output is correct
39 Correct 2 ms 632 KB Output is correct
40 Incorrect 32 ms 20756 KB Output isn't correct
41 Correct 2 ms 632 KB Output is correct
42 Correct 2 ms 1656 KB Output is correct
43 Correct 319 ms 107548 KB Output is correct
44 Correct 12 ms 8312 KB Output is correct
45 Correct 257 ms 91988 KB Output is correct
46 Correct 207 ms 78276 KB Output is correct
47 Correct 270 ms 92128 KB Output is correct
48 Correct 222 ms 82248 KB Output is correct
49 Correct 208 ms 78072 KB Output is correct
50 Correct 266 ms 82268 KB Output is correct
51 Correct 222 ms 82284 KB Output is correct
52 Correct 222 ms 82152 KB Output is correct
53 Correct 214 ms 81564 KB Output is correct
54 Correct 202 ms 66924 KB Output is correct
55 Correct 208 ms 65260 KB Output is correct
56 Correct 237 ms 82152 KB Output is correct
57 Correct 223 ms 59124 KB Output is correct
58 Correct 237 ms 65132 KB Output is correct
59 Correct 229 ms 60788 KB Output is correct
60 Correct 228 ms 69752 KB Output is correct
61 Correct 226 ms 77560 KB Output is correct
62 Correct 220 ms 77248 KB Output is correct
63 Correct 227 ms 77048 KB Output is correct
64 Correct 214 ms 60024 KB Output is correct
65 Correct 241 ms 80348 KB Output is correct
66 Correct 228 ms 73564 KB Output is correct
67 Correct 219 ms 81440 KB Output is correct
68 Correct 220 ms 81420 KB Output is correct
69 Correct 199 ms 57592 KB Output is correct
70 Incorrect 121 ms 31864 KB Output isn't correct
71 Incorrect 187 ms 48376 KB Output isn't correct
72 Correct 214 ms 52088 KB Output is correct
73 Incorrect 207 ms 52616 KB Output isn't correct
74 Incorrect 213 ms 57308 KB Output isn't correct
75 Incorrect 194 ms 59244 KB Output isn't correct
76 Correct 203 ms 60736 KB Output is correct
77 Correct 198 ms 61148 KB Output is correct
78 Correct 196 ms 61360 KB Output is correct
79 Incorrect 188 ms 33884 KB Output isn't correct
80 Incorrect 178 ms 35100 KB Output isn't correct
81 Incorrect 202 ms 35584 KB Output isn't correct
82 Correct 217 ms 63352 KB Output is correct
83 Incorrect 198 ms 63736 KB Output isn't correct
84 Incorrect 201 ms 28748 KB Output isn't correct
85 Incorrect 218 ms 62844 KB Output isn't correct
86 Incorrect 222 ms 75948 KB Output isn't correct
87 Correct 221 ms 61304 KB Output is correct
88 Incorrect 197 ms 62024 KB Output isn't correct
89 Incorrect 222 ms 70844 KB Output isn't correct
90 Incorrect 131 ms 46036 KB Output isn't correct
91 Correct 214 ms 66000 KB Output is correct
92 Correct 217 ms 67720 KB Output is correct
93 Correct 222 ms 74744 KB Output is correct
94 Incorrect 204 ms 70020 KB Output isn't correct
95 Incorrect 197 ms 63996 KB Output isn't correct
96 Incorrect 196 ms 63480 KB Output isn't correct
97 Correct 203 ms 75772 KB Output is correct
98 Correct 211 ms 62972 KB Output is correct
99 Incorrect 223 ms 69208 KB Output isn't correct
100 Incorrect 222 ms 74400 KB Output isn't correct