結果
問題 | No.2509 Beam Shateki |
ユーザー |
![]() |
提出日時 | 2024-01-17 00:35:27 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 169 ms / 2,000 ms |
コード長 | 2,826 bytes |
コンパイル時間 | 3,012 ms |
コンパイル使用メモリ | 213,068 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-28 03:06:21 |
合計ジャッジ時間 | 8,286 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
#pragma GCC optimize("O2")#include <algorithm>#include <array>#include <bit>#include <bitset>#include <cassert>#include <cctype>#include <cfenv>#include <cfloat>#include <chrono>#include <cinttypes>#include <climits>#include <cmath>#include <compare>#include <complex>#include <concepts>#include <cstdarg>#include <cstddef>#include <cstdint>#include <cstdio>#include <cstdlib>#include <cstring>#include <deque>#include <fstream>#include <functional>#include <initializer_list>#include <iomanip>#include <ios>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <map>#include <memory>#include <new>#include <numbers>#include <numeric>#include <ostream>#include <queue>#include <random>#include <ranges>#include <set>#include <span>#include <sstream>#include <stack>#include <streambuf>#include <string>#include <tuple>#include <type_traits>#include <variant>//#define int ll#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)#define INT128_MIN (-INT128_MAX - 1)#ifdef DEBUG#define dbg(x) cout << (#x) << " = " << x << '\n'#else#define dbg(x)#endifnamespace R = std::ranges;namespace V = std::views;using namespace std;using ll = long long;using ull = unsigned long long;using ldb = long double;//#define double ldbtemplate<class T, size_t N>ostream& operator<<(ostream& os, const array<T, N> &arr) {for(const T &X : arr)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const vector<T> &vec) {for(const T &X : vec)os << X << ' ';return os;}template<class T>ostream& operator<<(ostream& os, const set<T> &s) {for(const T &x : s)os << x << ' ';return os;}signed main() {ios::sync_with_stdio(false), cin.tie(NULL);int h, w; cin >> h >> w;vector a(h, vector<int>(w));for(auto &v : a)for(int &x : v)cin >> x;vector cand(4, vector<vector<array<int, 2>>>(h + w - 1));for(int i = 0; i < h; i++) {for(int j = 0; j < w; j++) {cand[0][i].push_back({i, j});cand[1][j].push_back({i, j});cand[2][i + j].push_back({i, j});cand[3][i - j + (w - 1)].push_back({i, j});}}int ans = 0, cost = 0;vector vis(h, vector<int>(w));auto dfs = [&](int i, auto self) -> void {if (i == 2) {ans = max(ans, cost);} else {for(int j = 0; j < 4; j++) {for(int k = 0; k < h + w - 1; k++) {for(auto [x, y] : cand[j][k])if (++vis[x][y] == 1)cost += a[x][y];self(i + 1, self);for(auto [x, y] : cand[j][k])if (--vis[x][y] == 0)cost -= a[x][y];}}}};dfs(0, dfs);cout << ans << '\n';return 0;}