oj.uz

답안 #343854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343854 2021-01-04T15:09:32 Z topovik Bomb (IZhO17_bomb) C++14
21 / 100
 99 ms 65924 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define f first
#define s second
#define pb push_back
#define INF 1000000000

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const ll N = 3e3;

const ll oo = 1e10;

ll pr[N][N];
ll n, m;

ll sum(ll sx, ll sy, ll ex, ll ey)
{
    return pr[ex][ey] - pr[sx - 1][ey] - pr[ex][sy - 1] + pr[sx - 1][sy - 1];
}

ll Check(ll width, ll x, ll y)
{
    ll sy = y - width;
    ll lx = 1, rx = x;
    while (lx < rx)
    {
        ll mdl = (lx + rx) >> 1;
        if (sum(mdl, sy, x, y) != (x - mdl + 1) * (width + 1)) lx = mdl + 1;
        else rx = mdl;
    }
    ll sx = lx;
    lx = x, rx = n;
    while (lx < rx)
    {
        ll mdl = (lx + rx + 1) >> 1;
        if (sum(x, sy, mdl, y) != (mdl - x + 1) * (width + 1)) rx = mdl - 1;
        else lx = mdl;
    }
    ll ex = lx;
    return ex - sx + 1;
}

int main()
{
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    string a[n];
    for (ll i = 0; i < n; i++) cin >> a[i];
    for (ll i = 1; i <= n; i++)
        for (ll j = 1; j <= m; j++) pr[i][j] = pr[i - 1][j] + pr[i][j - 1] - pr[i - 1][j - 1] + (a[i - 1][j - 1] == '1');
    ll ansx = oo, ansy = oo;
    for (ll i = 0; i < n; i++)
    {
        ll group = -oo;
        if (a[i][0] == '1') group = 0;
        for (ll j = 1; j < m; j++)
            if (a[i][j] == '1')
        {
            if (a[i][j - 1] == '1') group++;
            else                    group = 0;
        }
        else
        {
            if (group != -oo)
            {
                ll x = Check(group, i + 1, j);
                ansx = min(ansx, group + 1);
                ansy = min(ansy, x);
            }
            group = -oo;
        }
        if (group != -oo)
        {
            ll x = Check(group, i + 1, m);
            ansx = min(ansx, group + 1);
            ansy = min(ansy, x);
        }
    }
    if (ansx == oo) cout << 0 << endl;
    else cout << ansx * ansy;
}

Subtask #1
21.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 8 ms 10476 KB Output is correct
4 Correct 8 ms 10476 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Incorrect 1 ms 364 KB Output isn't correct
9 Incorrect 0 ms 364 KB Output isn't correct
10 Incorrect 0 ms 364 KB Output isn't correct
11 Incorrect 1 ms 364 KB Output isn't correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Incorrect 0 ms 364 KB Output isn't correct
17 Incorrect 1 ms 620 KB Output isn't correct
18 Incorrect 1 ms 620 KB Output isn't correct
19 Incorrect 1 ms 748 KB Output isn't correct
20 Incorrect 1 ms 748 KB Output isn't correct
21 Incorrect 1 ms 620 KB Output isn't correct
22 Incorrect 1 ms 748 KB Output isn't correct
23 Incorrect 1 ms 876 KB Output isn't correct
24 Incorrect 1 ms 748 KB Output isn't correct
25 Incorrect 1 ms 876 KB Output isn't correct
26 Incorrect 1 ms 876 KB Output isn't correct
27 Correct 2 ms 2284 KB Output is correct
28 Incorrect 2 ms 2540 KB Output isn't correct
29 Incorrect 3 ms 3052 KB Output isn't correct
30 Incorrect 4 ms 3692 KB Output isn't correct
31 Incorrect 3 ms 3052 KB Output isn't correct
32 Incorrect 3 ms 3436 KB Output isn't correct
33 Incorrect 4 ms 3948 KB Output isn't correct
34 Incorrect 2 ms 2540 KB Output isn't correct
35 Incorrect 4 ms 3948 KB Output isn't correct
36 Incorrect 4 ms 3948 KB Output isn't correct
37 Incorrect 1 ms 364 KB Output isn't correct
38 Correct 71 ms 65772 KB Output is correct
39 Incorrect 1 ms 364 KB Output isn't correct
40 Incorrect 11 ms 10752 KB Output isn't correct
41 Incorrect 1 ms 364 KB Output isn't correct
42 Incorrect 1 ms 876 KB Output isn't correct
43 Correct 72 ms 65784 KB Output is correct
44 Incorrect 4 ms 3948 KB Output isn't correct
45 Incorrect 72 ms 65772 KB Output isn't correct
46 Correct 99 ms 65772 KB Output is correct
47 Incorrect 74 ms 65772 KB Output isn't correct
48 Incorrect 74 ms 65772 KB Output isn't correct
49 Incorrect 74 ms 65772 KB Output isn't correct
50 Incorrect 73 ms 65772 KB Output isn't correct
51 Incorrect 74 ms 65772 KB Output isn't correct
52 Incorrect 73 ms 65772 KB Output isn't correct
53 Incorrect 73 ms 65772 KB Output isn't correct
54 Incorrect 73 ms 65772 KB Output isn't correct
55 Incorrect 74 ms 65772 KB Output isn't correct
56 Correct 88 ms 65772 KB Output is correct
57 Incorrect 74 ms 65924 KB Output isn't correct
58 Incorrect 77 ms 65772 KB Output isn't correct
59 Incorrect 71 ms 65772 KB Output isn't correct
60 Correct 73 ms 65708 KB Output is correct
61 Correct 74 ms 65772 KB Output is correct
62 Correct 73 ms 65772 KB Output is correct
63 Correct 70 ms 65772 KB Output is correct
64 Correct 72 ms 65772 KB Output is correct
65 Incorrect 73 ms 65772 KB Output isn't correct
66 Incorrect 72 ms 65772 KB Output isn't correct
67 Incorrect 75 ms 65772 KB Output isn't correct
68 Incorrect 74 ms 65772 KB Output isn't correct
69 Incorrect 72 ms 65772 KB Output isn't correct
70 Incorrect 47 ms 44012 KB Output isn't correct
71 Incorrect 72 ms 65772 KB Output isn't correct
72 Incorrect 74 ms 65900 KB Output isn't correct
73 Incorrect 71 ms 65772 KB Output isn't correct
74 Incorrect 71 ms 65772 KB Output isn't correct
75 Incorrect 71 ms 65772 KB Output isn't correct
76 Incorrect 72 ms 65772 KB Output isn't correct
77 Incorrect 71 ms 65772 KB Output isn't correct
78 Incorrect 74 ms 65772 KB Output isn't correct
79 Incorrect 72 ms 65772 KB Output isn't correct
80 Incorrect 70 ms 65772 KB Output isn't correct
81 Incorrect 71 ms 65900 KB Output isn't correct
82 Incorrect 72 ms 65772 KB Output isn't correct
83 Incorrect 73 ms 65772 KB Output isn't correct
84 Incorrect 70 ms 65772 KB Output isn't correct
85 Incorrect 73 ms 65772 KB Output isn't correct
86 Incorrect 72 ms 65772 KB Output isn't correct
87 Correct 71 ms 65772 KB Output is correct
88 Incorrect 73 ms 65772 KB Output isn't correct
89 Incorrect 72 ms 65900 KB Output isn't correct
90 Incorrect 50 ms 44012 KB Output isn't correct
91 Incorrect 73 ms 65772 KB Output isn't correct
92 Incorrect 72 ms 65772 KB Output isn't correct
93 Incorrect 72 ms 65772 KB Output isn't correct
94 Incorrect 73 ms 65900 KB Output isn't correct
95 Incorrect 71 ms 65772 KB Output isn't correct
96 Incorrect 73 ms 65772 KB Output isn't correct
97 Incorrect 73 ms 65900 KB Output isn't correct
98 Incorrect 72 ms 65772 KB Output isn't correct
99 Incorrect 71 ms 65900 KB Output isn't correct
100 Incorrect 72 ms 65772 KB Output isn't correct