oj.uz

답안 #456313

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
456313 2021-08-06T11:50:17 Z dxz05 Bomb (IZhO17_bomb) C++14
41 / 100
 1000 ms 113952 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;
}

int ans = 0;

bool fill(int x1, int y1, int x2, int y2){
    if (sum(x1, y1, x2, y2) != (x2 - x1 + 1) * (y2 - y1 + 1)) return false;
    for (int i = x1; i <= x2; i++){
        for (int j = y1; j <= y2; j++){
            bomb[i][j] = true;
        }
    }
    return true;
}

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 (!a[i][j] || bomb[i][j]) continue;
            fill(i, j, i + A - 1, j + B - 1);
        }
    }

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            if (!a[i][j] || bomb[i][j]) continue;
            if (fill(i, j, i + A - 1, j + B - 1)) continue;
            if (fill(i - A + 1, j, i, j + B - 1)) continue;
            if (fill(i, j - B + 1, i + A - 1, j)) continue;
            if (fill(i - A + 1, j - B + 1, i, j)) continue;
            return false;
        }
    }

    ans = max(ans, A * B);

    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 A = n, B = m;
    for (int j = 1; j <= m; j++){
        for (int i = 1; i <= n; i++){
            if (a[i][j] == 0) continue;
            int k = i;
            while (k <= n && a[k][j] == 1) k++;
            A = min(A, k - i);
            i = k - 1;
        }
    }

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            if (a[i][j] == 0) continue;
            int k = j;
            while (k <= m && a[i][k] == 1) k++;
            B = min(B, k - j);
            j = k - 1;
        }
    }

    if (check(A, B)){
        cout << ans;
        return;
    }

    if (A < B){
        for (int i = 1; i <= A; i++){
            int l = 1, r = B;
            while (l <= r){
                int mid = (l + r) >> 1;
                if (check(i, mid)){
                    l = mid + 1;
                } else r = mid - 1;
            }
        }
    } else {
        for (int i = 1; i <= B; i++){
            int l = 1, r = A;
            while (l <= r){
                int mid = (l + r) >> 1;
                if (check(mid, i)){
                    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:184:9: note: in expansion of macro 'debug'
  184 |         debug(test);
      |         ^~~~~

Subtask #1
41.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 13 ms 26496 KB Output is correct
4 Correct 13 ms 26556 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is 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 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Incorrect 1 ms 972 KB Output isn't correct
18 Correct 1 ms 1100 KB Output is correct
19 Incorrect 3 ms 1356 KB Output isn't correct
20 Incorrect 4 ms 1356 KB Output isn't correct
21 Correct 1 ms 836 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 6 ms 1356 KB Output is correct
24 Correct 2 ms 1228 KB Output is correct
25 Correct 8 ms 1356 KB Output is correct
26 Correct 1 ms 1356 KB Output is correct
27 Correct 6 ms 4044 KB Output is correct
28 Correct 14 ms 4300 KB Output is correct
29 Correct 542 ms 5528 KB Output is correct
30 Correct 573 ms 6436 KB Output is correct
31 Correct 267 ms 5068 KB Output is correct
32 Correct 150 ms 5840 KB Output is correct
33 Execution timed out 1095 ms 6732 KB Time limit exceeded
34 Correct 10 ms 4684 KB Output is correct
35 Correct 53 ms 6732 KB Output is correct
36 Correct 9 ms 6740 KB Output is correct
37 Correct 1 ms 488 KB Output is correct
38 Correct 200 ms 56240 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Runtime error 56 ms 31352 KB Execution killed with signal 11
41 Incorrect 1 ms 460 KB Output isn't correct
42 Correct 19 ms 1356 KB Output is correct
43 Runtime error 292 ms 113472 KB Execution killed with signal 11
44 Runtime error 25 ms 13388 KB Execution killed with signal 11
45 Runtime error 261 ms 113512 KB Execution killed with signal 11
46 Correct 209 ms 56264 KB Output is correct
47 Runtime error 266 ms 113476 KB Execution killed with signal 11
48 Execution timed out 1088 ms 56340 KB Time limit exceeded
49 Correct 241 ms 56392 KB Output is correct
50 Execution timed out 1091 ms 56244 KB Time limit exceeded
51 Execution timed out 1085 ms 56304 KB Time limit exceeded
52 Execution timed out 1086 ms 56312 KB Time limit exceeded
53 Execution timed out 1075 ms 56772 KB Time limit exceeded
54 Execution timed out 1090 ms 56612 KB Time limit exceeded
55 Execution timed out 1092 ms 113952 KB Time limit exceeded
56 Correct 230 ms 56724 KB Output is correct
57 Execution timed out 1096 ms 56708 KB Time limit exceeded
58 Execution timed out 1067 ms 56720 KB Time limit exceeded
59 Execution timed out 1068 ms 67484 KB Time limit exceeded
60 Correct 216 ms 56756 KB Output is correct
61 Execution timed out 1097 ms 56772 KB Time limit exceeded
62 Runtime error 290 ms 113860 KB Execution killed with signal 11
63 Runtime error 293 ms 113860 KB Execution killed with signal 11
64 Correct 209 ms 56756 KB Output is correct
65 Execution timed out 1076 ms 67012 KB Time limit exceeded
66 Execution timed out 1092 ms 56644 KB Time limit exceeded
67 Execution timed out 1095 ms 56680 KB Time limit exceeded
68 Execution timed out 1094 ms 56792 KB Time limit exceeded
69 Execution timed out 1063 ms 56644 KB Time limit exceeded
70 Runtime error 193 ms 91340 KB Execution killed with signal 11
71 Execution timed out 1072 ms 56716 KB Time limit exceeded
72 Runtime error 263 ms 113828 KB Execution killed with signal 11
73 Runtime error 267 ms 113752 KB Execution killed with signal 11
74 Execution timed out 1093 ms 56584 KB Time limit exceeded
75 Runtime error 263 ms 113796 KB Execution killed with signal 11
76 Execution timed out 1052 ms 56604 KB Time limit exceeded
77 Runtime error 285 ms 113712 KB Execution killed with signal 11
78 Execution timed out 1088 ms 56528 KB Time limit exceeded
79 Execution timed out 1072 ms 56480 KB Time limit exceeded
80 Execution timed out 1069 ms 56536 KB Time limit exceeded
81 Execution timed out 1094 ms 56580 KB Time limit exceeded
82 Runtime error 275 ms 113832 KB Execution killed with signal 11
83 Runtime error 272 ms 113780 KB Execution killed with signal 11
84 Execution timed out 1083 ms 56556 KB Time limit exceeded
85 Execution timed out 1092 ms 56424 KB Time limit exceeded
86 Execution timed out 1095 ms 56100 KB Time limit exceeded
87 Execution timed out 1090 ms 56132 KB Time limit exceeded
88 Runtime error 276 ms 113392 KB Execution killed with signal 11
89 Runtime error 261 ms 113348 KB Execution killed with signal 11
90 Execution timed out 1084 ms 45044 KB Time limit exceeded
91 Execution timed out 1093 ms 56132 KB Time limit exceeded
92 Execution timed out 1086 ms 56192 KB Time limit exceeded
93 Execution timed out 1089 ms 55968 KB Time limit exceeded
94 Execution timed out 1088 ms 55924 KB Time limit exceeded
95 Execution timed out 1046 ms 55940 KB Time limit exceeded
96 Runtime error 264 ms 113176 KB Execution killed with signal 11
97 Execution timed out 1042 ms 55940 KB Time limit exceeded
98 Execution timed out 1073 ms 55944 KB Time limit exceeded
99 Execution timed out 1085 ms 55944 KB Time limit exceeded
100 Execution timed out 1089 ms 55932 KB Time limit exceeded