oj.uz

답안 #170415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170415 2019-12-25T06:29:30 Z davitmarg Bomb (IZhO17_bomb) C++17
26 / 100
 554 ms 50452 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++;
                y = min(y, 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;
}

/*

8 8
00000000
01111100
01111100
01111100
01101100
01111100
01111100
00000000
 
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
26.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 20472 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 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 Incorrect 2 ms 376 KB Output isn't correct
11 Incorrect 2 ms 504 KB Output isn't correct
12 Incorrect 2 ms 504 KB Output isn't correct
13 Incorrect 2 ms 504 KB Output isn't correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 504 KB Output isn't correct
16 Correct 2 ms 504 KB Output is correct
17 Incorrect 3 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 1272 KB Output isn't correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 1020 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 Incorrect 3 ms 1272 KB Output isn't correct
27 Incorrect 10 ms 3320 KB Output isn't correct
28 Correct 11 ms 3704 KB Output is correct
29 Incorrect 14 ms 4600 KB Output isn't correct
30 Incorrect 17 ms 5496 KB Output isn't correct
31 Incorrect 15 ms 4392 KB Output isn't correct
32 Incorrect 15 ms 4984 KB Output isn't correct
33 Incorrect 19 ms 5752 KB Output isn't correct
34 Correct 10 ms 4088 KB Output is correct
35 Incorrect 19 ms 5752 KB Output isn't correct
36 Incorrect 20 ms 5752 KB Output isn't correct
37 Incorrect 2 ms 504 KB Output isn't correct
38 Correct 531 ms 50172 KB Output is correct
39 Incorrect 2 ms 504 KB Output isn't correct
40 Incorrect 67 ms 13944 KB Output isn't correct
41 Correct 2 ms 504 KB Output is correct
42 Correct 3 ms 1272 KB Output is correct
43 Correct 532 ms 50168 KB Output is correct
44 Correct 20 ms 5724 KB Output is correct
45 Incorrect 545 ms 50088 KB Output isn't correct
46 Correct 517 ms 50316 KB Output is correct
47 Incorrect 534 ms 50168 KB Output isn't correct
48 Incorrect 516 ms 50144 KB Output isn't correct
49 Incorrect 538 ms 50156 KB Output isn't correct
50 Incorrect 509 ms 50244 KB Output isn't correct
51 Incorrect 512 ms 50168 KB Output isn't correct
52 Incorrect 520 ms 50320 KB Output isn't correct
53 Incorrect 510 ms 50452 KB Output isn't correct
54 Incorrect 504 ms 50156 KB Output isn't correct
55 Incorrect 502 ms 50156 KB Output isn't correct
56 Correct 554 ms 50296 KB Output is correct
57 Incorrect 500 ms 50168 KB Output isn't correct
58 Incorrect 501 ms 50224 KB Output isn't correct
59 Incorrect 498 ms 50168 KB Output isn't correct
60 Correct 512 ms 50284 KB Output is correct
61 Correct 548 ms 49912 KB Output is correct
62 Correct 528 ms 50024 KB Output is correct
63 Correct 531 ms 50020 KB Output is correct
64 Correct 501 ms 50040 KB Output is correct
65 Incorrect 511 ms 49968 KB Output isn't correct
66 Incorrect 513 ms 50040 KB Output isn't correct
67 Incorrect 516 ms 49912 KB Output isn't correct
68 Incorrect 520 ms 50040 KB Output isn't correct
69 Incorrect 499 ms 50036 KB Output isn't correct
70 Incorrect 311 ms 40068 KB Output isn't correct
71 Incorrect 494 ms 49984 KB Output isn't correct
72 Incorrect 499 ms 50016 KB Output isn't correct
73 Incorrect 497 ms 49912 KB Output isn't correct
74 Incorrect 517 ms 50064 KB Output isn't correct
75 Incorrect 507 ms 49912 KB Output isn't correct
76 Incorrect 499 ms 49784 KB Output isn't correct
77 Incorrect 500 ms 49784 KB Output isn't correct
78 Incorrect 499 ms 49756 KB Output isn't correct
79 Incorrect 485 ms 49888 KB Output isn't correct
80 Incorrect 488 ms 49792 KB Output isn't correct
81 Incorrect 489 ms 49656 KB Output isn't correct
82 Incorrect 538 ms 49784 KB Output isn't correct
83 Incorrect 534 ms 49784 KB Output isn't correct
84 Incorrect 492 ms 49900 KB Output isn't correct
85 Incorrect 500 ms 49636 KB Output isn't correct
86 Incorrect 526 ms 49656 KB Output isn't correct
87 Incorrect 498 ms 49784 KB Output isn't correct
88 Incorrect 500 ms 49784 KB Output isn't correct
89 Incorrect 512 ms 49732 KB Output isn't correct
90 Incorrect 316 ms 39920 KB Output isn't correct
91 Incorrect 505 ms 49768 KB Output isn't correct
92 Incorrect 508 ms 49660 KB Output isn't correct
93 Incorrect 528 ms 49680 KB Output isn't correct
94 Incorrect 512 ms 49656 KB Output isn't correct
95 Incorrect 504 ms 49736 KB Output isn't correct
96 Incorrect 537 ms 49700 KB Output isn't correct
97 Incorrect 527 ms 49912 KB Output isn't correct
98 Incorrect 505 ms 49616 KB Output isn't correct
99 Incorrect 518 ms 49784 KB Output isn't correct
100 Incorrect 524 ms 49628 KB Output isn't correct