oj.uz

답안 #170413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170413 2019-12-25T06:19:23 Z davitmarg Bomb (IZhO17_bomb) C++17
38 / 100
 551 ms 55748 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 2505;

int n, m, a[N][N], nxt[N][N], d[N], Y, X, ans;

int main()
{
    cin >> n >> m;

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            char x;
            scanf(" %c", &x);
            a[i][j] += (x - '0');
        }
    X = m;
    Y = n;
    for (int i = 1; i <= n; i++)
        for (int j = m; j >= 1; j--)
        {
            if (a[i][j])
                nxt[i][j] = nxt[i][j + 1] + 1;
            else
                nxt[i][j] = 0;
            if (a[i][j - 1] == 0 && a[i][j])
                X = min(X, nxt[i][j]);
        }
    for (int j = 1; j <= m; j++)
    {
        int y = 0;
        for (int i = 1; i <= n; i++)
        {
            if (a[i][j])
                y++;
            else
                y = 0;
            if (a[i][j] && a[i + 1][j] == 0)
                Y = min(y, Y);
        }
    }

    for (int i = 1; i <= n; i++)
        d[i] = X;
    for (int j = 1; j <= m; j++)
    {
        int y = 0, x = X;
        for (int i = 1; i <= n; i++)
        {
            if (a[i][j] == 0 || (a[i][j - 1] == 1 && y == 0))
            {
                y = 0;
                x = X;
            }
            else
            {
                y++;
                x = min(x, nxt[i][j]);
                d[y] = min(x, d[y]);
            }
            //cout << i << " : " << j << " = " << y << " : " << x << endl;
        }
    }
    for (int i = 1; i <= Y; i++)
        ans = max(ans, i * d[i]);

    cout << ans << endl;
    return 0;
}

/*
 
6 6
000111
000111
001111
111100
111000
111000
 
*/

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:38:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf(" %c", &x);
             ~~~~~^~~~~~~~~~~

Subtask #1
38.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 21 ms 20344 KB Output is correct
4 Correct 21 ms 20344 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 504 KB Output isn't correct
9 Incorrect 2 ms 504 KB Output isn't correct
10 Correct 2 ms 376 KB Output is correct
11 Incorrect 2 ms 504 KB Output isn't correct
12 Incorrect 2 ms 376 KB Output isn't correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Incorrect 2 ms 504 KB Output isn't correct
16 Correct 2 ms 524 KB Output is correct
17 Incorrect 8 ms 888 KB Output isn't correct
18 Correct 3 ms 888 KB Output is correct
19 Incorrect 3 ms 1144 KB Output isn't correct
20 Incorrect 3 ms 1116 KB Output isn't correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 1016 KB Output is correct
23 Incorrect 3 ms 1272 KB Output isn't correct
24 Incorrect 3 ms 1016 KB Output isn't correct
25 Incorrect 3 ms 1144 KB Output isn't correct
26 Correct 3 ms 1272 KB Output is correct
27 Correct 10 ms 3448 KB Output is correct
28 Incorrect 12 ms 3704 KB Output isn't correct
29 Incorrect 14 ms 4600 KB Output isn't correct
30 Incorrect 17 ms 5368 KB Output isn't correct
31 Incorrect 14 ms 4348 KB Output isn't correct
32 Incorrect 15 ms 4984 KB Output isn't correct
33 Incorrect 18 ms 5752 KB Output isn't correct
34 Incorrect 10 ms 3960 KB Output isn't correct
35 Incorrect 19 ms 5752 KB Output isn't correct
36 Correct 20 ms 5752 KB Output is correct
37 Incorrect 2 ms 504 KB Output isn't correct
38 Correct 523 ms 55712 KB Output is correct
39 Incorrect 2 ms 504 KB Output isn't correct
40 Incorrect 66 ms 14200 KB Output isn't correct
41 Correct 2 ms 508 KB Output is correct
42 Correct 3 ms 1140 KB Output is correct
43 Correct 525 ms 55652 KB Output is correct
44 Correct 19 ms 5752 KB Output is correct
45 Incorrect 551 ms 55532 KB Output isn't correct
46 Correct 509 ms 55644 KB Output is correct
47 Incorrect 527 ms 55544 KB Output isn't correct
48 Incorrect 503 ms 55512 KB Output isn't correct
49 Correct 525 ms 55544 KB Output is correct
50 Correct 505 ms 55560 KB Output is correct
51 Correct 504 ms 55520 KB Output is correct
52 Correct 508 ms 55544 KB Output is correct
53 Incorrect 503 ms 55576 KB Output isn't correct
54 Correct 497 ms 55704 KB Output is correct
55 Incorrect 497 ms 55444 KB Output isn't correct
56 Correct 516 ms 55544 KB Output is correct
57 Incorrect 495 ms 55672 KB Output isn't correct
58 Correct 495 ms 55544 KB Output is correct
59 Correct 492 ms 55616 KB Output is correct
60 Correct 507 ms 55672 KB Output is correct
61 Correct 528 ms 55748 KB Output is correct
62 Correct 524 ms 55512 KB Output is correct
63 Correct 522 ms 55672 KB Output is correct
64 Correct 496 ms 55524 KB Output is correct
65 Correct 506 ms 55652 KB Output is correct
66 Incorrect 501 ms 55672 KB Output isn't correct
67 Incorrect 506 ms 55684 KB Output isn't correct
68 Incorrect 539 ms 55708 KB Output isn't correct
69 Correct 494 ms 55564 KB Output is correct
70 Incorrect 314 ms 43432 KB Output isn't correct
71 Incorrect 487 ms 55416 KB Output isn't correct
72 Incorrect 492 ms 55544 KB Output isn't correct
73 Incorrect 492 ms 55548 KB Output isn't correct
74 Incorrect 492 ms 55544 KB Output isn't correct
75 Incorrect 490 ms 55672 KB Output isn't correct
76 Incorrect 491 ms 55552 KB Output isn't correct
77 Incorrect 509 ms 55672 KB Output isn't correct
78 Incorrect 493 ms 55544 KB Output isn't correct
79 Incorrect 484 ms 55676 KB Output isn't correct
80 Incorrect 480 ms 55544 KB Output isn't correct
81 Incorrect 480 ms 55548 KB Output isn't correct
82 Incorrect 493 ms 55556 KB Output isn't correct
83 Incorrect 496 ms 55676 KB Output isn't correct
84 Incorrect 480 ms 55468 KB Output isn't correct
85 Incorrect 494 ms 55544 KB Output isn't correct
86 Incorrect 515 ms 55688 KB Output isn't correct
87 Incorrect 489 ms 55604 KB Output isn't correct
88 Incorrect 493 ms 55516 KB Output isn't correct
89 Incorrect 502 ms 55544 KB Output isn't correct
90 Incorrect 312 ms 43540 KB Output isn't correct
91 Incorrect 495 ms 55672 KB Output isn't correct
92 Incorrect 504 ms 55416 KB Output isn't correct
93 Incorrect 543 ms 55612 KB Output isn't correct
94 Incorrect 500 ms 55672 KB Output isn't correct
95 Incorrect 492 ms 55580 KB Output isn't correct
96 Incorrect 494 ms 55712 KB Output isn't correct
97 Incorrect 517 ms 55544 KB Output isn't correct
98 Incorrect 496 ms 55544 KB Output isn't correct
99 Incorrect 501 ms 55544 KB Output isn't correct
100 Incorrect 521 ms 55636 KB Output isn't correct