#920915 (C++17) No.2509 Beam Shateki

• 問題: No.2509 Beam Shateki
• ユーザー: rniya
• 提出日時: 2023-10-20 21:31:12
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,441 ms / 2,000 ms
• コード長: 3,867 bytes
• コンパイル時間: 2,293 ms
• コンパイル使用メモリ: 215,444 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-20 17:33:40
• 合計ジャッジ時間: 40,939 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	196 ms; 5,376 KB
testcase_04	AC	200 ms; 5,376 KB
testcase_05	AC	197 ms; 5,376 KB
testcase_06	AC	192 ms; 5,376 KB
testcase_07	AC	197 ms; 5,376 KB
testcase_08	AC	193 ms; 5,376 KB
testcase_09	AC	190 ms; 5,376 KB
testcase_10	AC	189 ms; 5,376 KB
testcase_11	AC	197 ms; 5,376 KB
testcase_12	AC	191 ms; 5,376 KB
testcase_13	AC	1,411 ms; 5,376 KB
testcase_14	AC	1,406 ms; 5,376 KB
testcase_15	AC	1,424 ms; 5,376 KB
testcase_16	AC	1,426 ms; 5,376 KB
testcase_17	AC	1,441 ms; 5,376 KB
testcase_18	AC	1,420 ms; 5,376 KB
testcase_19	AC	1,430 ms; 5,376 KB
testcase_20	AC	1,411 ms; 5,376 KB
testcase_21	AC	1,404 ms; 5,376 KB
testcase_22	AC	1,427 ms; 5,376 KB
testcase_23	AC	1,432 ms; 5,376 KB
testcase_24	AC	1,400 ms; 5,376 KB
testcase_25	AC	1,402 ms; 5,376 KB
testcase_26	AC	1,411 ms; 5,376 KB
testcase_27	AC	1,413 ms; 5,376 KB
testcase_28	AC	1,407 ms; 5,376 KB
testcase_29	AC	1,424 ms; 5,376 KB
testcase_30	AC	1,414 ms; 5,376 KB
testcase_31	AC	1,424 ms; 5,376 KB
testcase_32	AC	1,413 ms; 5,376 KB
testcase_33	AC	31 ms; 5,376 KB
testcase_34	AC	341 ms; 5,376 KB
testcase_35	AC	730 ms; 5,376 KB
testcase_36	AC	136 ms; 5,376 KB
testcase_37	AC	14 ms; 5,376 KB
testcase_38	AC	150 ms; 5,376 KB
testcase_39	AC	127 ms; 5,376 KB
testcase_40	AC	411 ms; 5,376 KB
testcase_41	AC	5 ms; 5,376 KB
testcase_42	AC	182 ms; 5,376 KB
testcase_43	AC	867 ms; 5,376 KB
testcase_44	AC	1,098 ms; 5,376 KB
testcase_45	AC	127 ms; 5,376 KB
testcase_46	AC	227 ms; 5,376 KB
testcase_47	AC	1,022 ms; 5,376 KB
testcase_48	AC	277 ms; 5,376 KB
testcase_49	AC	474 ms; 5,376 KB
testcase_50	AC	571 ms; 5,376 KB
testcase_51	AC	27 ms; 5,376 KB
testcase_52	AC	361 ms; 5,376 KB
testcase_53	AC	3 ms; 5,376 KB
testcase_54	AC	2 ms; 5,376 KB
testcase_55	AC	2 ms; 5,376 KB
testcase_56	AC	2 ms; 5,376 KB
testcase_57	AC	2 ms; 5,376 KB
testcase_58	AC	2 ms; 5,376 KB
testcase_59	AC	2 ms; 5,376 KB
testcase_60	AC	2 ms; 5,376 KB
testcase_61	AC	3 ms; 5,376 KB
testcase_62	AC	3 ms; 5,376 KB
testcase_63	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H, W;
    cin >> H >> W;
    vector A(H, vector<int>(W));
    cin >> A;

    ll ans = 0;
    vector<pair<int, int>> ex;
    for (int i = -1; i <= H; i++) {
        for (int j = -1; j <= W; j++) {
            if (i == -1 or i == H or j == -1 or j == W) {
                ex.emplace_back(i, j);
            }
        }
    }
    vector check(H, vector<bool>(W, false));
    for (int i = 0; i < int(ex.size()); i++) {
        for (int j = i; j < int(ex.size()); j++) {
            for (int dx1 = -1; dx1 <= 1; dx1++) {
                for (int dy1 = -1; dy1 <= 1; dy1++) {
                    if (dx1 == 0 and dy1 == 0) continue;
                    for (int dx2 = -1; dx2 <= 1; dx2++) {
                        for (int dy2 = -1; dy2 <= 1; dy2++) {
                            if (dx2 == 0 and dy2 == 0) continue;
                            ll sum = 0;
                            {
                                auto [x, y] = ex[i];
                                while (true) {
                                    x += dx1, y += dy1;
                                    if (x < 0 or H <= x or y < 0 or W <= y) break;
                                    if (not check[x][y]) sum += A[x][y];
                                    check[x][y] = true;
                                }
                            }
                            {
                                auto [x, y] = ex[j];
                                while (true) {
                                    x += dx2, y += dy2;
                                    if (x < 0 or H <= x or y < 0 or W <= y) break;
                                    if (not check[x][y]) sum += A[x][y];
                                    check[x][y] = true;
                                }
                            }
                            chmax(ans, sum);
                            {
                                auto [x, y] = ex[i];
                                while (true) {
                                    x += dx1, y += dy1;
                                    if (x < 0 or H <= x or y < 0 or W <= y) break;
                                    check[x][y] = false;
                                }
                            }
                            {
                                auto [x, y] = ex[j];
                                while (true) {
                                    x += dx2, y += dy2;
                                    if (x < 0 or H <= x or y < 0 or W <= y) break;
                                    check[x][y] = false;
                                }
                            }
                        }
                    }
                }
            }
        }
    }

    cout << ans << '\n';
    return 0;
}