oj.uz

답안 #957867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957867 2024-04-04T12:31:14 Z gaga999 Bomb (IZhO17_bomb) C++17
96 / 100
 231 ms 55836 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 2505;
char gd[N][N];
int up[N][N], dn[N][N], an[N];

signed main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%s", gd[i] + 1);
    bool ok = 0;
    for (int j = 1; j <= m; j++)
    {
        for (int i = 1; i <= n; i++)
            if (gd[i][j] == '1')
                up[i][j] = up[i - 1][j] + 1;
        for (int i = n; i > 0; i--)
            if (gd[i][j] == '1')
                dn[i][j] = dn[i + 1][j] + 1, ok = 1;
    }
    assert(ok);
    init(an, INF);
    int mx = m;
    for (int i = 1; i <= n; i++)
    {
        int m1 = INF, m2 = INF, cr = 0;
        for (int j = 1; j <= m; j++)
        {
            if (gd[i][j] == '0')
            {
                m1 = m2 = INF;
                if (cr)
                    tmin(mx, cr), cr = 0;
                continue;
            }
            cr++, tmin(m1, up[i][j]), tmin(m2, dn[i][j]);
            tmin(an[cr], m1 + m2 - 1);
            tmin(an[1], up[i][j] + dn[i][j] - 1);
        }
        for (int j = m; j > 0; j--)
        {
            if (gd[i][j] == '0')
            {
                m1 = m2 = INF;
                if (cr)
                    tmin(mx, cr), cr = 0;
                continue;
            }
            cr++, tmin(m1, up[i][j]), tmin(m2, dn[i][j]);
            tmin(an[cr], m1 + m2 - 1);
            tmin(an[1], up[i][j] + dn[i][j] - 1);
        }
    }
    int ans = 0;
    for (int i = 1; i <= mx; i++)
        tmax(ans, an[i] * i), tmin(an[i + 1], an[i]);
    prt(ans), putchar('\n');
}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
bomb.cpp:90:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         scanf("%s", gd[i] + 1);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
96.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 8 ms 54364 KB Output is correct
4 Correct 8 ms 54364 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 0 ms 2396 KB Output isn't correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 1 ms 2652 KB Output isn't correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4696 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 4696 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 3 ms 11100 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct
29 Correct 4 ms 10588 KB Output is correct
30 Correct 4 ms 10076 KB Output is correct
31 Correct 2 ms 7516 KB Output is correct
32 Correct 3 ms 10076 KB Output is correct
33 Correct 4 ms 10584 KB Output is correct
34 Correct 2 ms 5052 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Incorrect 5 ms 14940 KB Output isn't correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 218 ms 55480 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Incorrect 17 ms 23296 KB Output isn't correct
41 Correct 1 ms 2648 KB Output is correct
42 Correct 1 ms 3160 KB Output is correct
43 Correct 192 ms 53616 KB Output is correct
44 Correct 5 ms 13916 KB Output is correct
45 Correct 183 ms 55124 KB Output is correct
46 Correct 176 ms 55636 KB Output is correct
47 Correct 177 ms 55132 KB Output is correct
48 Correct 150 ms 55636 KB Output is correct
49 Correct 225 ms 55632 KB Output is correct
50 Correct 184 ms 55636 KB Output is correct
51 Correct 163 ms 55380 KB Output is correct
52 Correct 160 ms 55380 KB Output is correct
53 Correct 157 ms 55060 KB Output is correct
54 Correct 124 ms 47612 KB Output is correct
55 Correct 111 ms 44836 KB Output is correct
56 Correct 215 ms 55616 KB Output is correct
57 Correct 107 ms 42372 KB Output is correct
58 Correct 123 ms 45108 KB Output is correct
59 Correct 112 ms 44572 KB Output is correct
60 Correct 137 ms 54584 KB Output is correct
61 Correct 227 ms 55380 KB Output is correct
62 Correct 219 ms 55616 KB Output is correct
63 Correct 231 ms 55836 KB Output is correct
64 Correct 90 ms 54864 KB Output is correct
65 Correct 160 ms 55120 KB Output is correct
66 Correct 156 ms 55156 KB Output is correct
67 Correct 176 ms 55384 KB Output is correct
68 Correct 195 ms 55588 KB Output is correct
69 Correct 103 ms 42176 KB Output is correct
70 Correct 40 ms 20852 KB Output is correct
71 Correct 78 ms 41300 KB Output is correct
72 Correct 86 ms 42836 KB Output is correct
73 Correct 92 ms 43148 KB Output is correct
74 Correct 100 ms 47184 KB Output is correct
75 Correct 99 ms 50100 KB Output is correct
76 Correct 99 ms 51232 KB Output is correct
77 Correct 103 ms 51496 KB Output is correct
78 Correct 100 ms 51684 KB Output is correct
79 Correct 39 ms 16988 KB Output is correct
80 Correct 47 ms 21080 KB Output is correct
81 Correct 57 ms 21088 KB Output is correct
82 Correct 108 ms 52968 KB Output is correct
83 Correct 108 ms 53076 KB Output is correct
84 Correct 40 ms 10548 KB Output is correct
85 Correct 97 ms 52820 KB Output is correct
86 Correct 207 ms 54916 KB Output is correct
87 Correct 92 ms 52720 KB Output is correct
88 Correct 115 ms 52160 KB Output is correct
89 Correct 135 ms 53328 KB Output is correct
90 Correct 58 ms 44700 KB Output is correct
91 Correct 113 ms 52996 KB Output is correct
92 Correct 145 ms 51796 KB Output is correct
93 Correct 199 ms 54492 KB Output is correct
94 Correct 130 ms 52768 KB Output is correct
95 Correct 99 ms 53588 KB Output is correct
96 Correct 106 ms 52816 KB Output is correct
97 Correct 204 ms 55124 KB Output is correct
98 Correct 111 ms 53332 KB Output is correct
99 Correct 131 ms 53332 KB Output is correct
100 Correct 196 ms 54040 KB Output is correct