#921226 (C++23) No.2509 Beam Shateki

• 問題: No.2509 Beam Shateki
• ユーザー: sgfc
• 提出日時: 2023-10-20 22:23:15
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 4,824 bytes
• コンパイル時間: 5,520 ms
• コンパイル使用メモリ: 315,604 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-20 19:53:20
• 合計ジャッジ時間: 6,737 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 59 WA * 2

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#include <stdio.h>
#include <math.h>
#include <cassert>
#include "atcoder/all"
#include <float.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)
using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;
struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }
template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>;
using vvm = vector<vm>;
void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };
const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
template<class T, class U> bool chmin(T& a, const U& b) { const T olda = a; a = gmin(a, b); return olda != a; }
template<class T, class U> bool chmax(T& a, const U& b) { const T olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll h, w;
    cin >> h >> w;
    vvl a(h, vl(w, 0));
    REP(i, h) REP(j, w) cin >> a[i][j];
    vl rsum(h, 0);
    vl csum(w, 0);
    vl xsum1(h + w, 0);
    vl xsum2(h + w, 0);
    REP(i, h) REP(j, w) {
        rsum[i] += a[i][j];
        csum[j] += a[i][j];
        xsum1[i + j] += a[i][j];
        xsum2[i - j + w - 1] += a[i][j];
    }
    ll ans = 0;
    REP(i1, h) {
        ll tans = rsum[i1];
        REP(i2, h) {
            if (i2 == i1) continue;
            chmax(ans, tans + rsum[i2]);
        }
        REP(i2, w) {
            chmax(ans, tans + csum[i2] - a[i1][i2]);
        }
        REP(i2, h + w) {
            if (i2 >= i1 && i2 - i1 < w) {
                chmax(ans, tans + xsum1[i2] - a[i1][i2 - i1]);
            }
            else {
                chmax(ans, tans + xsum1[i2]);
            }
        }
        REP(i2, h + w) {
            ll ti = w - (i2 - i1) - 1;
            if (ti >= 0 && ti < w) {
                chmax(ans, tans + xsum2[i2] - a[i1][ti]);
            }
            else {
                chmax(ans, tans + xsum2[i2]);
            }
        }
    }
    REP(i1, w) {
        ll tans = csum[i1];
        REP(i2, w) {
            if (i2 == i1) continue;
            chmax(ans, tans + csum[i2]);
        }
        REP(i2, h + w) {
            if (i2 >= i1 && i2 - i1 < h) {
                chmax(ans, tans + xsum1[i2] - a[i2 - i1][i1]);
            }
            else {
                chmax(ans, tans + xsum1[i2]);
            }
        }
        REP(i2, h + w) {
            ll ti = i2 - (w - 1) + i1;
            if (ti >= 0 && ti < h) {
                chmax(ans, tans + xsum2[i2] - a[ti][i1]);
            }
            else {
                chmax(ans, tans + xsum2[i2]);
            }
        }
    }
    REP(i1, h + w) {
        ll tans = xsum1[i1];
        REP(i2, h + w) {
            if (i2 == i1) continue;
            chmax(ans, tans + xsum1[i2]);
        }
        REP(i2, h + w) {
            ll tr = (i1 + i2 - w + 1) / 2;
            ll tc = (i2 - i1 + w - 1) / 2;
            if (tr >= 0 && tc >= 0 && tr < h && tc < w) {
                chmax(ans, tans + xsum2[i2] - a[tr][tc]);
            }
            else {
                chmax(ans, tans + xsum2[i2]);
            }
        }
    }
    REP(i1, h + w) {
        ll tans = xsum2[i1];
        REP(i2, h + w) {
            if (i2 == i1) continue;
            chmax(ans, tans + xsum2[i2]);
        }
    }
    cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX