結果

問題 No.2509 Beam Shateki
ユーザー pmankiraipmankirai
提出日時 2023-10-20 22:26:54
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,727 bytes
コンパイル時間 2,087 ms
コンパイル使用メモリ 186,488 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-20 20:01:49
合計ジャッジ時間 30,649 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 133 ms
6,940 KB
testcase_04 AC 133 ms
6,944 KB
testcase_05 AC 134 ms
6,940 KB
testcase_06 AC 135 ms
6,940 KB
testcase_07 AC 135 ms
6,944 KB
testcase_08 AC 134 ms
6,944 KB
testcase_09 AC 134 ms
6,944 KB
testcase_10 AC 133 ms
6,940 KB
testcase_11 AC 135 ms
6,940 KB
testcase_12 AC 133 ms
6,940 KB
testcase_13 AC 1,069 ms
6,940 KB
testcase_14 AC 1,063 ms
6,944 KB
testcase_15 AC 1,066 ms
6,940 KB
testcase_16 AC 1,067 ms
6,940 KB
testcase_17 AC 1,065 ms
6,944 KB
testcase_18 AC 1,069 ms
6,944 KB
testcase_19 AC 1,060 ms
6,940 KB
testcase_20 AC 1,069 ms
6,944 KB
testcase_21 AC 1,062 ms
6,940 KB
testcase_22 AC 1,064 ms
6,940 KB
testcase_23 AC 1,068 ms
6,940 KB
testcase_24 AC 1,068 ms
6,944 KB
testcase_25 AC 1,062 ms
6,940 KB
testcase_26 AC 1,070 ms
6,940 KB
testcase_27 AC 1,067 ms
6,940 KB
testcase_28 AC 1,064 ms
6,940 KB
testcase_29 AC 1,068 ms
6,940 KB
testcase_30 AC 1,064 ms
6,940 KB
testcase_31 WA -
testcase_32 AC 1,063 ms
6,944 KB
testcase_33 AC 20 ms
6,944 KB
testcase_34 AC 246 ms
6,944 KB
testcase_35 AC 518 ms
6,944 KB
testcase_36 RE -
testcase_37 RE -
testcase_38 AC 104 ms
6,940 KB
testcase_39 RE -
testcase_40 AC 297 ms
6,944 KB
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 AC 779 ms
6,944 KB
testcase_48 AC 201 ms
6,944 KB
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 AC 3 ms
6,940 KB
testcase_56 AC 2 ms
6,944 KB
testcase_57 AC 3 ms
6,940 KB
testcase_58 WA -
testcase_59 AC 2 ms
6,944 KB
testcase_60 WA -
testcase_61 AC 2 ms
6,940 KB
testcase_62 WA -
testcase_63 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:56:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   56 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:63:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   63 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:73:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   73 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:83:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   83 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:93:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   93 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:103:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  103 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:114:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  114 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:121:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  121 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:131:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  131 |             for (auto [pi, pj] : p2) sum += a[pi][pj];
      |                       ^
main.cpp:141:23: warning: structured bindings only

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;

void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
typedef pair<int, int> P;

const int INF = 1e9;
const ll LINF = 1e18;
const int MAX = 100010;

void solve() {
    int h, w;
    cin >> h >> w;
    VV<int> a(h, V<int>(w));
    rep(i, h) rep(j, w) cin >> a[i][j];
    int ans = 0;
    rep(i, h) {
        set<P> p;
        rep(j, w) p.insert({i, j});
        rep(i2, h) {
            auto p2 = p;
            rep(j2, w) p2.insert({i2, j2});
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(j2, w) {
            auto p2 = p;
            rep(i2, h) p2.insert({i2, j2});
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(i2, h) {
            auto p2 = p;
            rep(j2, w) {
                if (i2 + j2 >= h) break;
                p2.insert({i2 + j2, j2});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(j2, w) {
            auto p2 = p;
            rep(j2d, w) {
                if (j2 + j2d >= w) break;
                p2.insert({j2d, j2 + j2d});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(i2, h) {
            auto p2 = p;
            rep(j2, w) {
                if (i2 - j2 < 0) break;
                p2.insert({i2 - j2, j2});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(j2, w) {
            auto p2 = p;
            rep(j2d, w) {
                if (j2 - j2d < 0) break;
                p2.insert({j2d, j2 - j2d});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
    }
    rep(j, w) {
        set<P> p;
        rep(i, h) p.insert({i, j});
        rep(i2, h) {
            auto p2 = p;
            rep(j2, w) p2.insert({i2, j2});
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(j2, w) {
            auto p2 = p;
            rep(i2, h) p2.insert({i2, j2});
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(i2, h) {
            auto p2 = p;
            rep(j2, w) {
                if (i2 + j2 >= h) break;
                p2.insert({i2 + j2, j2});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(j2, w) {
            auto p2 = p;
            rep(j2d, w) {
                if (j2 + j2d >= w) break;
                p2.insert({j2d, j2 + j2d});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(i2, h) {
            auto p2 = p;
            rep(j2, w) {
                if (i2 - j2 < 0) break;
                p2.insert({i2 - j2, j2});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
        rep(j2, w) {
            auto p2 = p;
            rep(j2d, w) {
                if (j2 - j2d < 0) break;
                p2.insert({j2d, j2 - j2d});
            }
            int sum = 0;
            for (auto [pi, pj] : p2) sum += a[pi][pj];
            chmax(ans, sum);
        }
    }
    cout << ans << "\n";
}

int main() {
    speedUpIO();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        // cout << solve() << "\n";
        // cout << (solve() ? "Yes" : "No") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}
0