oj.uz

답안 #173097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173097 2020-01-03T11:09:07 Z VEGAnn Bomb (IZhO17_bomb) C++14
35 / 100
 1000 ms 104900 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) ((int)x.size())
#define MP make_pair
#define ft first
#define sd second
#define pii pair<int, int>
#define PB push_back
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2510;
const int oo = 2e9;
int n, m, ans, a[N][N], pref[N][N], vl[N][N], pl[N][N];

bool ok(int ht, int wd){
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            pl[i][j] = 0;

    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++){
        if (i + ht - 1 > n || j + wd - 1 > m)
            break;
        int i1 = i + ht - 1, i2 = i - 1;
        int j1 = j + wd - 1, j2 = j - 1;
        int kol = pref[i1][j1] - pref[i2][j1] - pref[i1][j2] + pref[i2][j2];

        if (kol > 0) continue;

        pl[i][j]++; pl[i][j + wd]--;
        pl[i + ht][j]--; pl[i + ht][j + wd]++;

    }

    for (int i = 1; i <= m; i++){
        int cr = 0;
        for (int j = 1; j <= m; j++){
            cr += pl[i][j];
            vl[i][j] = cr;
        }
    }

    for (int j = 1; j <= m; j++){
        int cr = 0;
        for (int i = 1; i <= n; i++){
            cr += vl[i][j];
            if (a[i][j] == 1 && cr == 0)
                return 0;
        }
    }

    return 1;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("in.txt","r",stdin);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++){
        char c; cin >> c;
        a[i][j] = (c == '1' ? 1 : 0);
        pref[i][j] = (a[i][j] ^ 1) + pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
    }

    int wd = m;
    for (int ht = 1; ht <= n; ht++){
        while (wd > 0 && !ok(ht, wd))
            wd--;
        if (wd == 0) break;
        ans = max(ans, ht * wd);
    }

    cout << ans;

    return 0;
}

Subtask #1
35.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Incorrect 2 ms 632 KB Output isn't correct
3 Incorrect 114 ms 30584 KB Output isn't correct
4 Incorrect 82 ms 30584 KB Output isn't correct
5 Execution timed out 1042 ms 24952 KB Time limit exceeded
6 Correct 680 ms 8568 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 1 ms 632 KB Output is correct
13 Incorrect 2 ms 504 KB Output isn't correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 4 ms 1528 KB Output is correct
18 Correct 4 ms 1528 KB Output is correct
19 Correct 13 ms 1912 KB Output is correct
20 Correct 6 ms 1912 KB Output is correct
21 Correct 6 ms 1528 KB Output is correct
22 Correct 5 ms 1784 KB Output is correct
23 Correct 8 ms 2168 KB Output is correct
24 Correct 6 ms 1784 KB Output is correct
25 Correct 8 ms 2168 KB Output is correct
26 Correct 8 ms 2216 KB Output is correct
27 Incorrect 66 ms 6268 KB Output isn't correct
28 Correct 116 ms 7424 KB Output is correct
29 Correct 212 ms 8312 KB Output is correct
30 Correct 350 ms 10492 KB Output is correct
31 Correct 258 ms 8952 KB Output is correct
32 Correct 239 ms 9464 KB Output is correct
33 Correct 410 ms 11000 KB Output is correct
34 Correct 50 ms 6904 KB Output is correct
35 Correct 276 ms 11000 KB Output is correct
36 Correct 330 ms 11000 KB Output is correct
37 Correct 2 ms 632 KB Output is correct
38 Execution timed out 1067 ms 104696 KB Time limit exceeded
39 Correct 2 ms 708 KB Output is correct
40 Execution timed out 1024 ms 27448 KB Time limit exceeded
41 Correct 1 ms 760 KB Output is correct
42 Correct 9 ms 2168 KB Output is correct
43 Execution timed out 1052 ms 104668 KB Time limit exceeded
44 Correct 499 ms 11000 KB Output is correct
45 Execution timed out 1086 ms 104696 KB Time limit exceeded
46 Execution timed out 1076 ms 104696 KB Time limit exceeded
47 Execution timed out 1081 ms 104696 KB Time limit exceeded
48 Execution timed out 1076 ms 104824 KB Time limit exceeded
49 Execution timed out 1082 ms 104900 KB Time limit exceeded
50 Execution timed out 1039 ms 104696 KB Time limit exceeded
51 Execution timed out 1083 ms 104712 KB Time limit exceeded
52 Execution timed out 1039 ms 104664 KB Time limit exceeded
53 Execution timed out 1077 ms 104696 KB Time limit exceeded
54 Execution timed out 1084 ms 104824 KB Time limit exceeded
55 Execution timed out 1095 ms 104696 KB Time limit exceeded
56 Execution timed out 1066 ms 104688 KB Time limit exceeded
57 Execution timed out 1086 ms 104776 KB Time limit exceeded
58 Execution timed out 1084 ms 104696 KB Time limit exceeded
59 Execution timed out 1057 ms 104696 KB Time limit exceeded
60 Execution timed out 1074 ms 104760 KB Time limit exceeded
61 Execution timed out 1061 ms 104672 KB Time limit exceeded
62 Execution timed out 1079 ms 104696 KB Time limit exceeded
63 Execution timed out 1086 ms 104732 KB Time limit exceeded
64 Execution timed out 1086 ms 104696 KB Time limit exceeded
65 Execution timed out 1065 ms 104836 KB Time limit exceeded
66 Execution timed out 1072 ms 104824 KB Time limit exceeded
67 Execution timed out 1061 ms 104780 KB Time limit exceeded
68 Execution timed out 1073 ms 104696 KB Time limit exceeded
69 Execution timed out 1080 ms 104696 KB Time limit exceeded
70 Execution timed out 1082 ms 82808 KB Time limit exceeded
71 Execution timed out 1088 ms 104696 KB Time limit exceeded
72 Execution timed out 1067 ms 104796 KB Time limit exceeded
73 Execution timed out 1078 ms 104696 KB Time limit exceeded
74 Execution timed out 1069 ms 104672 KB Time limit exceeded
75 Execution timed out 1046 ms 104696 KB Time limit exceeded
76 Execution timed out 1103 ms 104696 KB Time limit exceeded
77 Execution timed out 1031 ms 104796 KB Time limit exceeded
78 Execution timed out 1012 ms 104700 KB Time limit exceeded
79 Execution timed out 1077 ms 104748 KB Time limit exceeded
80 Execution timed out 1067 ms 104668 KB Time limit exceeded
81 Execution timed out 1066 ms 104696 KB Time limit exceeded
82 Execution timed out 1082 ms 104696 KB Time limit exceeded
83 Execution timed out 1055 ms 104728 KB Time limit exceeded
84 Execution timed out 1053 ms 104816 KB Time limit exceeded
85 Execution timed out 1072 ms 104696 KB Time limit exceeded
86 Execution timed out 1068 ms 104696 KB Time limit exceeded
87 Execution timed out 1058 ms 104696 KB Time limit exceeded
88 Execution timed out 1083 ms 104788 KB Time limit exceeded
89 Execution timed out 1076 ms 104696 KB Time limit exceeded
90 Execution timed out 1064 ms 82892 KB Time limit exceeded
91 Execution timed out 1040 ms 104812 KB Time limit exceeded
92 Execution timed out 1053 ms 104824 KB Time limit exceeded
93 Execution timed out 1054 ms 104824 KB Time limit exceeded
94 Execution timed out 1092 ms 104824 KB Time limit exceeded
95 Execution timed out 1059 ms 104696 KB Time limit exceeded
96 Execution timed out 1082 ms 104696 KB Time limit exceeded
97 Execution timed out 1067 ms 104696 KB Time limit exceeded
98 Execution timed out 1087 ms 104716 KB Time limit exceeded
99 Execution timed out 1074 ms 104792 KB Time limit exceeded
100 Execution timed out 1071 ms 104832 KB Time limit exceeded