# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710404 | pavement | Bomb (IZhO17_bomb) | C++17 | 170 ms | 131076 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
int N, M, width = LLONG_MAX, height = LLONG_MAX, up[2505][2505], down[2505][2505], lft[2505][2505], rig[2505][2505];
char C[2505][2505];
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
cin >> C[i][j];
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (C[i][j] == '1') {
up[i][j] = (i > 1 && up[i - 1][j] ? up[i - 1][j] : i);
lft[i][j] = (j > 1 && lft[i][j - 1] ? lft[i][j - 1] : j);
}
}
for (int j = M; j >= 1; j--) {
if (C[i][j] == '1') rig[i][j] = (j < M && rig[i][j + 1] ? rig[i][j + 1] : j);
}
}
for (int i = N; i >= 1; i--) {
for (int j = 1; j <= M; j++) {
if (C[i][j] == '1') down[i][j] = (i < N && down[i + 1][j] ? down[i + 1][j] : i);
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (C[i][j] == '1') {
width = min(width, rig[i][j] - lft[i][j] + 1);
height = min(height, down[i][j] - up[i][j] + 1);
}
}
}
assert(width != LLONG_MAX && height != LLONG_MAX);
cout << width * height << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |