oj.uz

답안 #1037260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037260 2024-07-28T11:46:37 Z Alfraganus Bomb (IZhO17_bomb) C++17
49 / 100
 1000 ms 108116 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define str string
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define len(x) x.size()

#define print(a)          \
    for (auto &x : a)     \
        cout << x << " "; \
    cout << endl;

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

const int mod = 1e9 + 7;

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 <= 450 and m <= 450){
        vector<vector<int>> pref(n + 1, vector<int> (m + 1));
        for(int i = 0; i < n; i ++)
            for(int j = 0; j < m; j ++)
                pref[i + 1][j + 1] = pref[i][j + 1] + pref[i + 1][j] - pref[i][j] + (a[i][j] == '0');
        vector<vector<array<int, 2>>> dp(n, vector<array<int, 2>> (m, {0, 0}));
        int ans = 1, mx = m;
        for(int i = 1; i <= n; i ++){
            for(int j = 1; j <= mx; j ++){
                bool flag = 1;
                for(int x = 0; x < n; x ++){
                    for(int y = 0; y < m; y ++){
                        if(x + i <= n and y + j <= m and pref[x + i][y + j] - pref[x + i][y] - pref[x][y + j] + pref[x][y] == 0)
                            dp[x][y] = {i, j};
                        else{
                            dp[x][y] = {0, 0};
                            if(y > 0 and dp[x][y - 1][1] > 1)
                                dp[x][y] = {dp[x][y - 1][0], dp[x][y - 1][1] - 1};
                            if(x > 0 and dp[x - 1][y][0] > 1)
                                dp[x][y] = max(dp[x][y], {dp[x - 1][y][0] - 1, dp[x - 1][y][1]});
                        }
                        if(a[x][y] == '1' and dp[x][y][0] == 0 and dp[x][y][1] == 0){
                            flag = 0;
                            break;
                        }
                    }
                    if(!flag)
                        break;
                }
                if(flag)
                    ans = max(ans, i * j);
                else{
                    mx = j - 1;
                    break;
                }
            }
        }
        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()
{
    fastio;
    #ifdef Javohir
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
        cout << endl;
    }
}

Subtask #1
49.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 9 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 4 ms 604 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 14 ms 3164 KB Output is correct
29 Execution timed out 1100 ms 3420 KB Time limit exceeded
30 Correct 255 ms 4952 KB Output is correct
31 Correct 264 ms 4160 KB Output is correct
32 Correct 151 ms 4188 KB Output is correct
33 Correct 986 ms 5468 KB Output is correct
34 Correct 19 ms 2396 KB Output is correct
35 Correct 180 ms 5468 KB Output is correct
36 Correct 709 ms 5468 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 105 ms 108012 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Incorrect 13 ms 13336 KB Output isn't correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 55 ms 604 KB Output is correct
43 Correct 103 ms 108008 KB Output is correct
44 Execution timed out 1032 ms 5464 KB Time limit exceeded
45 Incorrect 104 ms 107860 KB Output isn't correct
46 Correct 106 ms 107860 KB Output is correct
47 Incorrect 105 ms 107860 KB Output isn't correct
48 Incorrect 105 ms 108012 KB Output isn't correct
49 Correct 110 ms 108012 KB Output is correct
50 Incorrect 110 ms 107860 KB Output isn't correct
51 Incorrect 104 ms 107856 KB Output isn't correct
52 Incorrect 103 ms 108116 KB Output isn't correct
53 Incorrect 103 ms 107856 KB Output isn't correct
54 Incorrect 100 ms 107856 KB Output isn't correct
55 Incorrect 101 ms 107856 KB Output isn't correct
56 Correct 114 ms 107860 KB Output is correct
57 Incorrect 107 ms 107860 KB Output isn't correct
58 Incorrect 106 ms 107860 KB Output isn't correct
59 Incorrect 106 ms 107864 KB Output isn't correct
60 Correct 111 ms 107996 KB Output is correct
61 Correct 129 ms 107860 KB Output is correct
62 Correct 109 ms 107860 KB Output is correct
63 Correct 109 ms 107860 KB Output is correct
64 Correct 104 ms 107856 KB Output is correct
65 Incorrect 107 ms 107880 KB Output isn't correct
66 Incorrect 104 ms 107872 KB Output isn't correct
67 Incorrect 107 ms 108008 KB Output isn't correct
68 Incorrect 107 ms 107856 KB Output isn't correct
69 Incorrect 108 ms 107860 KB Output isn't correct
70 Incorrect 62 ms 67148 KB Output isn't correct
71 Incorrect 98 ms 108012 KB Output isn't correct
72 Incorrect 102 ms 107856 KB Output isn't correct
73 Incorrect 102 ms 107888 KB Output isn't correct
74 Incorrect 103 ms 107856 KB Output isn't correct
75 Incorrect 101 ms 107856 KB Output isn't correct
76 Incorrect 103 ms 107860 KB Output isn't correct
77 Incorrect 107 ms 107856 KB Output isn't correct
78 Incorrect 102 ms 107856 KB Output isn't correct
79 Incorrect 100 ms 108024 KB Output isn't correct
80 Incorrect 98 ms 107860 KB Output isn't correct
81 Incorrect 100 ms 107860 KB Output isn't correct
82 Incorrect 104 ms 107856 KB Output isn't correct
83 Incorrect 103 ms 107884 KB Output isn't correct
84 Incorrect 99 ms 107980 KB Output isn't correct
85 Incorrect 103 ms 107856 KB Output isn't correct
86 Incorrect 239 ms 107860 KB Output isn't correct
87 Incorrect 103 ms 107856 KB Output isn't correct
88 Incorrect 101 ms 107872 KB Output isn't correct
89 Incorrect 104 ms 108012 KB Output isn't correct
90 Incorrect 63 ms 67152 KB Output isn't correct
91 Incorrect 116 ms 107996 KB Output isn't correct
92 Incorrect 103 ms 108012 KB Output isn't correct
93 Incorrect 109 ms 107856 KB Output isn't correct
94 Incorrect 110 ms 108016 KB Output isn't correct
95 Incorrect 99 ms 107860 KB Output isn't correct
96 Incorrect 102 ms 107856 KB Output isn't correct
97 Incorrect 108 ms 108008 KB Output isn't correct
98 Incorrect 105 ms 107952 KB Output isn't correct
99 Incorrect 100 ms 107860 KB Output isn't correct
100 Incorrect 106 ms 107860 KB Output isn't correct