oj.uz

Submission #210074

# Submission time Handle Problem Language Result Execution time Memory
210074 2020-03-16T14:01:16 Z bash Bomb (IZhO17_bomb) C++17
100 / 100
 357 ms 63776 KB 
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}

const int MAXN = 2600;
 
int n, m;
char s[MAXN][MAXN];
int ans[MAXN];
int up[MAXN][MAXN];
int dw[MAXN][MAXN];
 
int main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; ++i)
		scanf(" %s", s[i]);
	int mxh = n;
	int mxw = m;
	for (int i = 0; i < n; ++i) {
		int cnt = 0;
		for (int j = 0; j < m; ++j) {
			if (s[i][j] == '1')
				++cnt;
			if (s[i][j] == '1' && (j == m - 1 || s[i][j + 1] == '0')) {
				mxw = min(mxw, cnt);
				cnt = 0;
			}
		}
	}
	for (int i = 0; i < m; ++i) {
		int cnt = 0;
		for (int j = 0; j < n; ++j) {
			if (s[j][i] == '1')
				++cnt, up[j][i] = cnt;
			if (s[j][i] == '1' && (j == n - 1 || s[j + 1][i] == '0')) {
				mxh = min(mxh, cnt);
				cnt = 0;
			}
		}
	}
	for (int i = 0; i < m; ++i) {
		int cnt = 0;
		for (int j = n - 1; j >= 0; --j) {
			if (s[j][i] == '1')
				++cnt, dw[j][i] = cnt;
			else
				cnt = 0;
		}
	}
	for (int i = 0; i <= mxw; ++i)
		ans[i] = mxh;
 
	for (int i = 0; i < n; ++i) {
		int a = MAXN;
		int b = MAXN;
		int cnt = 0;
		for (int j = 0; j < m; ++j) {
			if (s[i][j] == '1') {
				a = min(a, up[i][j]);
				b = min(b, dw[i][j]);
				++cnt;
				ans[cnt] = min(ans[cnt], a + b - 1);
			}
			else {
				a = MAXN;
				b = MAXN;
				cnt = 0;
			}
		}
	}
 
	for (int i = 0; i < n; ++i) {
		int a = MAXN;
		int b = MAXN;
		int cnt = 0;
		for (int j = m - 1; j >= 0; --j) {
			if (s[i][j] == '1') {
				a = min(a, up[i][j]);
				b = min(b, dw[i][j]);
				++cnt;
				ans[cnt] = min(ans[cnt], a + b - 1);
			}
			else {
				a = MAXN;
				b = MAXN;
				cnt = 0;
			}
		}
	}
	int res = ans[1];
	for (int i = 1; i <= mxw; ++i)
		res = max(res, i * ans[i]);
	cout << res << "\n";
 
	return 0;
}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:91:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
bomb.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %s", s[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 17 ms 26744 KB Output is correct
4 Correct 17 ms 26744 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 1048 KB Output is correct
18 Correct 5 ms 760 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 5 ms 1016 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 1144 KB Output is correct
24 Correct 5 ms 1016 KB Output is correct
25 Correct 5 ms 1400 KB Output is correct
26 Correct 6 ms 1420 KB Output is correct
27 Correct 12 ms 4088 KB Output is correct
28 Correct 7 ms 1656 KB Output is correct
29 Correct 9 ms 5368 KB Output is correct
30 Correct 9 ms 4472 KB Output is correct
31 Correct 7 ms 3192 KB Output is correct
32 Correct 8 ms 4216 KB Output is correct
33 Correct 10 ms 5496 KB Output is correct
34 Correct 6 ms 1784 KB Output is correct
35 Correct 8 ms 2168 KB Output is correct
36 Correct 11 ms 6904 KB Output is correct
37 Correct 5 ms 504 KB Output is correct
38 Correct 346 ms 63736 KB Output is correct
39 Correct 5 ms 508 KB Output is correct
40 Correct 44 ms 16352 KB Output is correct
41 Correct 5 ms 504 KB Output is correct
42 Correct 6 ms 1400 KB Output is correct
43 Correct 288 ms 59072 KB Output is correct
44 Correct 12 ms 6264 KB Output is correct
45 Correct 294 ms 60024 KB Output is correct
46 Correct 266 ms 63736 KB Output is correct
47 Correct 279 ms 60152 KB Output is correct
48 Correct 278 ms 63744 KB Output is correct
49 Correct 347 ms 63736 KB Output is correct
50 Correct 278 ms 63736 KB Output is correct
51 Correct 276 ms 63628 KB Output is correct
52 Correct 270 ms 63608 KB Output is correct
53 Correct 265 ms 62968 KB Output is correct
54 Correct 213 ms 49404 KB Output is correct
55 Correct 203 ms 47480 KB Output is correct
56 Correct 346 ms 63736 KB Output is correct
57 Correct 198 ms 41848 KB Output is correct
58 Correct 205 ms 46868 KB Output is correct
59 Correct 200 ms 43768 KB Output is correct
60 Correct 267 ms 55524 KB Output is correct
61 Correct 355 ms 63736 KB Output is correct
62 Correct 348 ms 63712 KB Output is correct
63 Correct 357 ms 63736 KB Output is correct
64 Correct 203 ms 46584 KB Output is correct
65 Correct 264 ms 62584 KB Output is correct
66 Correct 260 ms 57848 KB Output is correct
67 Correct 277 ms 63776 KB Output is correct
68 Correct 288 ms 63736 KB Output is correct
69 Correct 202 ms 41464 KB Output is correct
70 Correct 87 ms 19448 KB Output is correct
71 Correct 175 ms 34424 KB Output is correct
72 Correct 194 ms 39928 KB Output is correct
73 Correct 199 ms 40696 KB Output is correct
74 Correct 194 ms 41940 KB Output is correct
75 Correct 193 ms 43640 KB Output is correct
76 Correct 200 ms 45044 KB Output is correct
77 Correct 199 ms 45432 KB Output is correct
78 Correct 198 ms 45688 KB Output is correct
79 Correct 123 ms 18040 KB Output is correct
80 Correct 118 ms 19448 KB Output is correct
81 Correct 139 ms 19704 KB Output is correct
82 Correct 197 ms 48120 KB Output is correct
83 Correct 214 ms 48380 KB Output is correct
84 Correct 113 ms 13432 KB Output is correct
85 Correct 189 ms 47224 KB Output is correct
86 Correct 301 ms 62456 KB Output is correct
87 Correct 187 ms 46072 KB Output is correct
88 Correct 197 ms 47096 KB Output is correct
89 Correct 225 ms 56312 KB Output is correct
90 Correct 118 ms 33528 KB Output is correct
91 Correct 199 ms 50936 KB Output is correct
92 Correct 226 ms 53728 KB Output is correct
93 Correct 282 ms 61560 KB Output is correct
94 Correct 218 ms 55672 KB Output is correct
95 Correct 193 ms 48316 KB Output is correct
96 Correct 187 ms 47992 KB Output is correct
97 Correct 291 ms 62352 KB Output is correct
98 Correct 208 ms 47864 KB Output is correct
99 Correct 226 ms 55256 KB Output is correct
100 Correct 326 ms 61112 KB Output is correct