oj.uz

답안 #452102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
452102 2021-08-03T19:08:18 Z dxz05 Bomb (IZhO17_bomb) C++14
11 / 100
 1000 ms 56008 KB 
#pragma GCC optimize("Ofast,O2,O3")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 3e2;
const int M = 2522;

int n, m;
int a[M][M];
bool bomb[M][M];
int dp[M][M];

int sum(int x1, int y1, int x2, int y2){
    assert(x1 <= x2 && y1 <= y2);
    int res = dp[x2][y2];
    res -= dp[x1 - 1][y2];
    res -= dp[x2][y1 - 1];
    res += dp[x1 - 1][y1 - 1];
    return res;
}

bool check(int A, int B){
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++) bomb[i][j] = false;
    }

    for (int i = 1; i <= n - A + 1; i++){
        for (int j = 1; j <= m - B + 1; j++){
            if (bomb[i][j] || !a[i][j]) continue;
            if (sum(i, j, i + A - 1, j + B - 1) == A * B){
                for (int x = i; x <= i + A - 1; x++){
                    for (int y = j; y <= j + B - 1; y++){
                        bomb[x][y] = true;
                    }
                }
            }
        }
    }

    for (int i = n; i >= A; i--){
        for (int j = m; j >= B; j--){
            if (bomb[i][j] || !a[i][j]) continue;
            if (sum(i - A + 1, j - B + 1, i, j) == A * B){
                for (int x = i - A + 1; x <= i; x++){
                    for (int y = j - B + 1; y <= j; y++){
                        bomb[x][y] = true;
                    }
                }
            }
        }
    }

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            if (!bomb[i][j] && a[i][j]) return false;
        }
    }

    return true;
}

void solve(int TC) {
    cin >> n >> m;

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            char ch;
            cin >> ch;
            a[i][j] = ch - '0';
            dp[i][j] = dp[i][j - 1] + a[i][j];
        }
    }

    for (int j = 1; j <= m; j++){
        for (int i = 1; i <= n; i++){
            dp[i][j] += dp[i - 1][j];
        }
    }

    int ans = 0;
    for (int i = 1; i <= n; i++){
        int l = 1, r = m;
        while (l <= r){
            int mid = (l + r) >> 1;
            if (check(i, mid)){
                ans = max(ans, i * mid);
                l = mid + 1;
            } else r = mid - 1;
        }
    }

    cout << ans;

}

int main() {
    startTime = clock();
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Compilation message

bomb.cpp: In function 'int main()':
bomb.cpp:19:20: warning: statement has no effect [-Wunused-value]
   19 | #define debug(...) 42
      |                    ^~
bomb.cpp:148:9: note: in expansion of macro 'debug'
  148 |         debug(test);
      |         ^~~~~

Subtask #1
11.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 186 ms 26572 KB Output is correct
4 Correct 221 ms 26556 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 1 ms 460 KB Output isn't correct
9 Incorrect 1 ms 460 KB Output isn't correct
10 Incorrect 1 ms 460 KB Output isn't correct
11 Incorrect 1 ms 460 KB Output isn't correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Incorrect 1 ms 460 KB Output isn't correct
16 Incorrect 1 ms 460 KB Output isn't correct
17 Incorrect 6 ms 972 KB Output isn't correct
18 Incorrect 3 ms 972 KB Output isn't correct
19 Incorrect 9 ms 1356 KB Output isn't correct
20 Incorrect 9 ms 1356 KB Output isn't correct
21 Incorrect 3 ms 844 KB Output isn't correct
22 Incorrect 6 ms 1188 KB Output isn't correct
23 Incorrect 13 ms 1356 KB Output isn't correct
24 Incorrect 7 ms 1224 KB Output isn't correct
25 Incorrect 15 ms 1468 KB Output isn't correct
26 Incorrect 22 ms 1356 KB Output isn't correct
27 Correct 654 ms 4044 KB Output is correct
28 Incorrect 325 ms 4220 KB Output isn't correct
29 Execution timed out 1091 ms 5324 KB Time limit exceeded
30 Execution timed out 1092 ms 6220 KB Time limit exceeded
31 Incorrect 673 ms 5060 KB Output isn't correct
32 Incorrect 861 ms 5800 KB Output isn't correct
33 Execution timed out 1079 ms 6604 KB Time limit exceeded
34 Incorrect 279 ms 4692 KB Output isn't correct
35 Incorrect 947 ms 6624 KB Output isn't correct
36 Execution timed out 1057 ms 6604 KB Time limit exceeded
37 Incorrect 1 ms 460 KB Output isn't correct
38 Execution timed out 1095 ms 55820 KB Time limit exceeded
39 Incorrect 1 ms 460 KB Output isn't correct
40 Execution timed out 1099 ms 15548 KB Time limit exceeded
41 Incorrect 1 ms 460 KB Output isn't correct
42 Incorrect 19 ms 1356 KB Output isn't correct
43 Execution timed out 1076 ms 55776 KB Time limit exceeded
44 Execution timed out 1091 ms 6604 KB Time limit exceeded
45 Execution timed out 1087 ms 55748 KB Time limit exceeded
46 Execution timed out 1086 ms 55816 KB Time limit exceeded
47 Execution timed out 1090 ms 55804 KB Time limit exceeded
48 Execution timed out 1082 ms 55808 KB Time limit exceeded
49 Execution timed out 1090 ms 55780 KB Time limit exceeded
50 Execution timed out 1092 ms 55748 KB Time limit exceeded
51 Execution timed out 1090 ms 55748 KB Time limit exceeded
52 Execution timed out 1090 ms 55752 KB Time limit exceeded
53 Execution timed out 1089 ms 55760 KB Time limit exceeded
54 Execution timed out 1096 ms 55748 KB Time limit exceeded
55 Execution timed out 1064 ms 55740 KB Time limit exceeded
56 Execution timed out 1084 ms 55828 KB Time limit exceeded
57 Execution timed out 1088 ms 56008 KB Time limit exceeded
58 Execution timed out 1091 ms 55808 KB Time limit exceeded
59 Execution timed out 1033 ms 55836 KB Time limit exceeded
60 Execution timed out 1094 ms 55764 KB Time limit exceeded
61 Execution timed out 1087 ms 55840 KB Time limit exceeded
62 Execution timed out 1084 ms 55796 KB Time limit exceeded
63 Execution timed out 1095 ms 55788 KB Time limit exceeded
64 Execution timed out 1087 ms 55828 KB Time limit exceeded
65 Execution timed out 1085 ms 55772 KB Time limit exceeded
66 Execution timed out 1087 ms 55752 KB Time limit exceeded
67 Execution timed out 1090 ms 55752 KB Time limit exceeded
68 Execution timed out 1092 ms 55752 KB Time limit exceeded
69 Execution timed out 1085 ms 55752 KB Time limit exceeded
70 Execution timed out 1095 ms 44612 KB Time limit exceeded
71 Execution timed out 1091 ms 55752 KB Time limit exceeded
72 Execution timed out 1094 ms 55748 KB Time limit exceeded
73 Execution timed out 1099 ms 55840 KB Time limit exceeded
74 Execution timed out 1089 ms 55748 KB Time limit exceeded
75 Execution timed out 1095 ms 55728 KB Time limit exceeded
76 Execution timed out 1088 ms 55796 KB Time limit exceeded
77 Execution timed out 1099 ms 55748 KB Time limit exceeded
78 Execution timed out 1094 ms 55796 KB Time limit exceeded
79 Execution timed out 1092 ms 55748 KB Time limit exceeded
80 Execution timed out 1088 ms 55808 KB Time limit exceeded
81 Execution timed out 1097 ms 55804 KB Time limit exceeded
82 Execution timed out 1095 ms 55752 KB Time limit exceeded
83 Execution timed out 1092 ms 55768 KB Time limit exceeded
84 Execution timed out 1082 ms 55748 KB Time limit exceeded
85 Execution timed out 1087 ms 55748 KB Time limit exceeded
86 Execution timed out 1083 ms 55760 KB Time limit exceeded
87 Execution timed out 1088 ms 55748 KB Time limit exceeded
88 Execution timed out 1087 ms 55748 KB Time limit exceeded
89 Execution timed out 1094 ms 55748 KB Time limit exceeded
90 Execution timed out 1092 ms 44680 KB Time limit exceeded
91 Execution timed out 1096 ms 55836 KB Time limit exceeded
92 Execution timed out 1089 ms 55748 KB Time limit exceeded
93 Execution timed out 1101 ms 55748 KB Time limit exceeded
94 Execution timed out 1094 ms 55748 KB Time limit exceeded
95 Execution timed out 1092 ms 55748 KB Time limit exceeded
96 Execution timed out 1090 ms 55720 KB Time limit exceeded
97 Execution timed out 1075 ms 55748 KB Time limit exceeded
98 Execution timed out 1084 ms 55860 KB Time limit exceeded
99 Execution timed out 1093 ms 55748 KB Time limit exceeded
100 Execution timed out 1080 ms 55832 KB Time limit exceeded