結果
| 問題 |
No.2509 Beam Shateki
|
| コンテスト | |
| ユーザー |
 pmankirai
|
| 提出日時 | 2023-10-20 22:26:54 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.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 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 41 WA * 5 RE * 15 |
コンパイルメッセージ
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
ソースコード
#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;
}