oj.uz

답안 #855463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855463 2023-10-01T09:28:00 Z Alfraganus Bomb (IZhO17_bomb) C++17
33 / 100
 127 ms 104940 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long
#define fs first
#define ss second
#define all(a) a.begin(), a.end()
#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;

#define printmp(a)   \
    for (auto x : a) \
        cout << x.fs << ' ' << x.ss << endl;

void solve(){
    int n, m;
    cin >> n >> m;
    vector<vector<char>> a(n, vector<char> (m));
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < m; j ++)
            cin >> a[i][j];
    if(n <= 40 and m <= 40){
        int ans = 0;
        for(int i = 1; i <= n; i ++){
            for(int j = 1; j <= m; j ++){
                vector<vector<char>> b = a;
                for(int i1 = 0; i1 <= n - i; i1 ++){
                    for(int i2 = 0; i2 <= m - j; i2 ++){
                        if(b[i1][i2] != '0'){
                            bool flag = 1;
                            for(int x = 0; x < i; x ++){
                                for(int y = 0; y < j; y ++){
                                    if(b[i1 + x][i2 + y] == '0')
                                        flag = false;
                                }
                            }
                            if(flag){
                                for(int x = 0; x < i; x ++){
                                    for(int y = 0; y < j; y ++){
                                        b[i1 + x][i2 + y] = '2';
                                    }
                                }
                            }
                        }
                    }
                }
                int cnt = 0;
                for(int i = 0; i < n; i ++){
                    for(int j = 0; j < m; j ++){
                        cnt += b[i][j] == '1';
                    }
                }
                if(cnt == 0)
                    ans = max(ans, i * j);
            }
        }
        cout << ans;
        return;
    }
    vector<vector<int>> dp_right(n, vector<int>(m)), dp_down(n, vector<int>(m));
    for(int i = n - 1; i >= 0; i --){
        for(int j = m - 1; j >= 0; j --){
            if(a[i][j] == '1'){
                dp_right[i][j] = (j == m - 1 ? 0 : dp_right[i][j + 1]) + 1;
                dp_down[i][j] = (i == n - 1 ? 0 : dp_down[i + 1][j]) + 1;
            }
            else{
                dp_right[i][j] = 0;
                dp_down[i][j] = 0;
            }
        }
    }

    int x = m, y = n;
    for(int i = 0; i < n; i ++){
        for(int j = 0; j < m; j ++){
            if(a[i][j] == '1'){
                if(j == 0 or a[i][j - 1] == '0')
                    x = min(x, dp_right[i][j]);
                if(i == 0 or a[i - 1][j] == '0')
                    y = min(y, dp_down[i][j]);
            }
        }
    }
    cout << x * y << endl;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    // freopen("bomb.in", "r", stdin);
    // freopen("bomb.out", "w", stdout);
    int t = 1;
    // cin >> t;
    while(t --){
        solve();
        cout << endl;
    }
}

Subtask #1
33.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 400 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Incorrect 0 ms 344 KB Output isn't correct
22 Incorrect 0 ms 348 KB Output isn't correct
23 Incorrect 0 ms 604 KB Output isn't correct
24 Incorrect 0 ms 352 KB Output isn't correct
25 Incorrect 0 ms 604 KB Output isn't correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 1628 KB Output is correct
28 Incorrect 2 ms 2140 KB Output isn't correct
29 Incorrect 2 ms 2396 KB Output isn't correct
30 Incorrect 4 ms 3420 KB Output isn't correct
31 Incorrect 3 ms 2908 KB Output isn't correct
32 Incorrect 3 ms 2908 KB Output isn't correct
33 Incorrect 4 ms 3676 KB Output isn't correct
34 Incorrect 2 ms 1628 KB Output isn't correct
35 Incorrect 4 ms 3676 KB Output isn't correct
36 Correct 4 ms 3672 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 114 ms 104700 KB Output is correct
39 Correct 2 ms 348 KB Output is correct
40 Incorrect 15 ms 13384 KB Output isn't correct
41 Correct 2 ms 548 KB Output is correct
42 Incorrect 1 ms 604 KB Output isn't correct
43 Correct 109 ms 104684 KB Output is correct
44 Incorrect 5 ms 3676 KB Output isn't correct
45 Incorrect 115 ms 104696 KB Output isn't correct
46 Correct 106 ms 104532 KB Output is correct
47 Incorrect 109 ms 104532 KB Output isn't correct
48 Incorrect 106 ms 104532 KB Output isn't correct
49 Correct 112 ms 104580 KB Output is correct
50 Incorrect 107 ms 104532 KB Output isn't correct
51 Incorrect 112 ms 104684 KB Output isn't correct
52 Incorrect 114 ms 104684 KB Output isn't correct
53 Incorrect 109 ms 104688 KB Output isn't correct
54 Incorrect 108 ms 104528 KB Output isn't correct
55 Incorrect 119 ms 104696 KB Output isn't correct
56 Correct 112 ms 104696 KB Output is correct
57 Incorrect 109 ms 104684 KB Output isn't correct
58 Incorrect 108 ms 104696 KB Output isn't correct
59 Incorrect 104 ms 104528 KB Output isn't correct
60 Correct 111 ms 104532 KB Output is correct
61 Correct 118 ms 104700 KB Output is correct
62 Correct 111 ms 104528 KB Output is correct
63 Correct 115 ms 104684 KB Output is correct
64 Correct 105 ms 104684 KB Output is correct
65 Incorrect 112 ms 104684 KB Output isn't correct
66 Incorrect 108 ms 104704 KB Output isn't correct
67 Incorrect 108 ms 104696 KB Output isn't correct
68 Incorrect 109 ms 104532 KB Output isn't correct
69 Incorrect 103 ms 104704 KB Output isn't correct
70 Incorrect 65 ms 67152 KB Output isn't correct
71 Incorrect 105 ms 104680 KB Output isn't correct
72 Incorrect 111 ms 104524 KB Output isn't correct
73 Incorrect 103 ms 104696 KB Output isn't correct
74 Incorrect 104 ms 104560 KB Output isn't correct
75 Incorrect 102 ms 104528 KB Output isn't correct
76 Incorrect 112 ms 104528 KB Output isn't correct
77 Incorrect 105 ms 104528 KB Output isn't correct
78 Incorrect 107 ms 104704 KB Output isn't correct
79 Incorrect 100 ms 104680 KB Output isn't correct
80 Incorrect 99 ms 104528 KB Output isn't correct
81 Incorrect 99 ms 104448 KB Output isn't correct
82 Incorrect 110 ms 104684 KB Output isn't correct
83 Incorrect 105 ms 104904 KB Output isn't correct
84 Incorrect 100 ms 104696 KB Output isn't correct
85 Incorrect 105 ms 104528 KB Output isn't correct
86 Incorrect 127 ms 104788 KB Output isn't correct
87 Incorrect 105 ms 104544 KB Output isn't correct
88 Incorrect 105 ms 104700 KB Output isn't correct
89 Incorrect 105 ms 104532 KB Output isn't correct
90 Incorrect 70 ms 67148 KB Output isn't correct
91 Incorrect 114 ms 104700 KB Output isn't correct
92 Incorrect 106 ms 104684 KB Output isn't correct
93 Incorrect 113 ms 104628 KB Output isn't correct
94 Incorrect 107 ms 104696 KB Output isn't correct
95 Incorrect 109 ms 104680 KB Output isn't correct
96 Incorrect 110 ms 104536 KB Output isn't correct
97 Incorrect 115 ms 104532 KB Output isn't correct
98 Incorrect 104 ms 104528 KB Output isn't correct
99 Incorrect 125 ms 104940 KB Output isn't correct
100 Incorrect 113 ms 104528 KB Output isn't correct