結果
問題 | No.2509 Beam Shateki |
ユーザー |
|
提出日時 | 2023-11-16 16:37:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 4,327 bytes |
コンパイル時間 | 3,485 ms |
コンパイル使用メモリ | 255,144 KB |
最終ジャッジ日時 | 2025-02-17 22:15:08 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#define SELECTER(_1,_2,_3,SELECT,...) SELECT#define rep1(i,n) for(int i=0;i<(int)n;++i)#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define fi first#define se second#define PrintR LogOutput#ifdef _DEBUG#define Log(...) LogOutput(__VA_ARGS__)#else#define Log(...)#endifusing namespace std;using namespace atcoder;using ll=long long;using ld=long double;using pii=pair<int,int>;using pll=pair<long long,long long>;using pdd=pair<long double,long double>;using tp=tuple<int,int,int>;using tpll=tuple<ll,ll,ll>;using veci=vector<int>;using vecpii=vector<pair<int,int>>;using vecll=vector<long long>;using vecpll=vector<pair<long long,long long>>;using vecpdd=vector<pair<long double,long double>>;using vecs=vector<string>;using vecb=vector<bool>;using vecd=vector<long double>;using vectp=vector<tp>;using vectpll=vector<tpll>;using mint=modint998244353;using mint10=modint1000000007;template<typename T, typename S>istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}template<typename T, typename S>ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}ostream& operator<<(ostream& out, const mint& a){return out << a.val();}ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}ostream& operator<<(ostream& out, const modint& a){return out << a.val();}template<typename T>ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}template<typename T, typename S>pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}template<typename T, typename S>pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}constexpr ll INF=numeric_limits<ll>::max() / 4;constexpr int inf=numeric_limits<int>::max() / 2;constexpr ll MOD=998244353;const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};template<typename... Args>void LogOutput(Args&&... args){stringstream ss;((ss << args << ' '), ...);cout << ss.str().substr(0, ss.str().length() - 1) << endl;}template<typename T>void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}int main(){ios::sync_with_stdio(false);std::cin.tie(nullptr);int h, w;cin>>h>>w;vector p(h, veci(w));rep(i, h) rep(j, w) cin>>p[i][j];reverse(all(p));vecll a(h), b(w), c(h + w), d(h + w);rep(i, h) rep(j, w){a[i] += p[i][j];b[j] += p[i][j];c[i + j] += p[i][j];d[i + w - j - 1] += p[i][j];}ll ans = 0;rep(i, h){chmax(ans, a[i]);rep(j, h) if(i != j) chmax(ans, a[i] + a[j]);rep(j, w) chmax(ans, a[i] + b[j] - p[i][j]);rep(j, h + w){int cs = j - i, cs2 = i + w - 1 - j;chmax(ans, a[i] + c[j] - (cs >= 0 && cs < w ? p[i][cs] : 0));chmax(ans, a[i] + d[j] - (cs2 >= 0 && cs2 < w ? p[i][cs2] : 0));}}rep(i, w){chmax(ans, b[i]);rep(j, w) if(i != j) chmax(ans, b[i] + b[j]);rep(j, h + w){int cs = j - i, cs2 = i - (w - 1) + j;chmax(ans, b[i] + c[j] - (cs >= 0 && cs < h ? p[cs][i] : 0));chmax(ans, b[i] + d[j] - (cs2 >= 0 && cs2 < h ? p[cs2][i] : 0));}}rep(i, h + w){chmax(ans, c[i]);chmax(ans, d[i]);rep(j, h + w) if(i != j) chmax(ans, c[i] + c[j]);rep(j, h + w) if(i != j) chmax(ans, d[i] + d[j]);rep(j, h + w){int cs = i - j + (w - 1);if(cs % 2) cs = -1;else cs /= 2;int cs2 = i - cs;if(cs >= w || cs2 >= h) cs = -1;chmax(ans, c[i] + d[j] - (cs >= 0 && cs2 >= 0 ? p[cs2][cs] : 0));}}cout<<ans<<endl;}