結果
問題 | No.2509 Beam Shateki |
ユーザー |
![]() |
提出日時 | 2023-10-20 21:47:20 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,470 ms / 2,000 ms |
コード長 | 3,583 bytes |
コンパイル時間 | 7,488 ms |
コンパイル使用メモリ | 324,184 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-20 18:13:05 |
合計ジャッジ時間 | 41,005 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}#endifusing ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}#define reps(i,a,n) for(int i=(a);i<(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()#define pcnt(x) __builtin_popcount(x)ll myceil(ll a,ll b){return (a+b-1)/b;}template<typename T,size_t n,size_t id=0>auto vec(const int (&d)[n],const T &init=T()){if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));else return init;}#ifdef LOCAL#include "debug.h"#else#define debug(...) static_cast<void>(0)#define debugg(...) static_cast<void>(0)template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}#endifvoid SOLVE();int main(){ios::sync_with_stdio(false);cin.tie(nullptr);#ifdef LOCALclock_t start=clock();#endifint testcase=1;//cin>>testcase;for(int i=0;i<testcase;i++){SOLVE();}#ifdef LOCALcerr<<"time:";cerr<<(clock()-start)/1000;cerr<<"ms\n";#endif}int h,w;inline bool inarea(int x,int y){return 0<=x&&0<=y&&x<h&&y<w;}vector<pair<int,int>>around(int x,int y){vector<pair<int,int>>ret;vector<int>dx{1,0,-1,0},dy{0,1,0,-1};rep(i,4){int cx=x+dx[i],cy=y+dy[i];if(inarea(cx,cy))ret.emplace_back(cx,cy);}return ret;}vector<pair<int,int>>around8(int x,int y){vector<pair<int,int>>ret;vector<int>dx{1,1,0,-1,-1,-1,0,1},dy{0,1,1,1,0,-1,-1,-1};rep(i,8){int cx=x+dx[i],cy=y+dy[i];if(inarea(cx,cy))ret.emplace_back(cx,cy);}return ret;}void SOLVE(){cin>>h>>w;vector<vector<int>>a(h,vector<int>(w));cin>>a;int ans=-1e9;vector<pair<pair<int,int>,vector<pair<int,int>>>>xydxdy;rep(i,h)xydxdy.emplace_back(pair<int,int>{i,0},vector<pair<int,int>>{{1,1},{0,1},{-1,1}});rep(j,w)xydxdy.emplace_back(pair<int,int>{0,j},vector<pair<int,int>>{{1,-1},{1,0},{1,1}});rep(j,w)xydxdy.emplace_back(pair<int,int>{h-1,j},vector<pair<int,int>>{{-1,1}});rep(i,xydxdy.size()-1)reps(j,i+1,xydxdy.size()){for(auto [dx,dy]:xydxdy[i].second)for(auto [dx2,dy2]:xydxdy[j].second){unordered_set<int>st;int x,y;tie(x,y)=xydxdy[i].first;int sum=0;while(inarea(x,y)){sum+=a[x][y];st.insert(x*100+y);x+=dx,y+=dy;}tie(x,y)=xydxdy[j].first;if(i==0&&j==3)debug(sum);while(inarea(x,y)){if(!st.contains(x*100+y))sum+=a[x][y];x+=dx2,y+=dy2;}chmax(ans,sum);}}cout<<ans<<endl;}