結果
問題 | No.2509 Beam Shateki |
ユーザー | noya2 |
提出日時 | 2023-10-20 21:57:57 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 81 ms / 2,000 ms |
コード長 | 5,884 bytes |
コンパイル時間 | 3,893 ms |
コンパイル使用メモリ | 265,388 KB |
実行使用メモリ | 4,348 KB |
最終ジャッジ日時 | 2023-10-20 21:58:25 |
合計ジャッジ時間 | 7,924 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 3 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 22 ms
4,348 KB |
testcase_04 | AC | 22 ms
4,348 KB |
testcase_05 | AC | 22 ms
4,348 KB |
testcase_06 | AC | 22 ms
4,348 KB |
testcase_07 | AC | 22 ms
4,348 KB |
testcase_08 | AC | 22 ms
4,348 KB |
testcase_09 | AC | 22 ms
4,348 KB |
testcase_10 | AC | 22 ms
4,348 KB |
testcase_11 | AC | 22 ms
4,348 KB |
testcase_12 | AC | 22 ms
4,348 KB |
testcase_13 | AC | 79 ms
4,348 KB |
testcase_14 | AC | 79 ms
4,348 KB |
testcase_15 | AC | 79 ms
4,348 KB |
testcase_16 | AC | 80 ms
4,348 KB |
testcase_17 | AC | 79 ms
4,348 KB |
testcase_18 | AC | 79 ms
4,348 KB |
testcase_19 | AC | 79 ms
4,348 KB |
testcase_20 | AC | 79 ms
4,348 KB |
testcase_21 | AC | 81 ms
4,348 KB |
testcase_22 | AC | 79 ms
4,348 KB |
testcase_23 | AC | 80 ms
4,348 KB |
testcase_24 | AC | 79 ms
4,348 KB |
testcase_25 | AC | 80 ms
4,348 KB |
testcase_26 | AC | 79 ms
4,348 KB |
testcase_27 | AC | 79 ms
4,348 KB |
testcase_28 | AC | 79 ms
4,348 KB |
testcase_29 | AC | 79 ms
4,348 KB |
testcase_30 | AC | 79 ms
4,348 KB |
testcase_31 | AC | 79 ms
4,348 KB |
testcase_32 | AC | 79 ms
4,348 KB |
testcase_33 | AC | 8 ms
4,348 KB |
testcase_34 | AC | 33 ms
4,348 KB |
testcase_35 | AC | 51 ms
4,348 KB |
testcase_36 | AC | 20 ms
4,348 KB |
testcase_37 | AC | 15 ms
4,348 KB |
testcase_38 | AC | 21 ms
4,348 KB |
testcase_39 | AC | 20 ms
4,348 KB |
testcase_40 | AC | 36 ms
4,348 KB |
testcase_41 | AC | 4 ms
4,348 KB |
testcase_42 | AC | 25 ms
4,348 KB |
testcase_43 | AC | 58 ms
4,348 KB |
testcase_44 | AC | 65 ms
4,348 KB |
testcase_45 | AC | 18 ms
4,348 KB |
testcase_46 | AC | 31 ms
4,348 KB |
testcase_47 | AC | 65 ms
4,348 KB |
testcase_48 | AC | 30 ms
4,348 KB |
testcase_49 | AC | 41 ms
4,348 KB |
testcase_50 | AC | 44 ms
4,348 KB |
testcase_51 | AC | 8 ms
4,348 KB |
testcase_52 | AC | 34 ms
4,348 KB |
testcase_53 | AC | 2 ms
4,348 KB |
testcase_54 | AC | 2 ms
4,348 KB |
testcase_55 | AC | 3 ms
4,348 KB |
testcase_56 | AC | 2 ms
4,348 KB |
testcase_57 | AC | 2 ms
4,348 KB |
testcase_58 | AC | 2 ms
4,348 KB |
testcase_59 | AC | 2 ms
4,348 KB |
testcase_60 | AC | 3 ms
4,348 KB |
testcase_61 | AC | 3 ms
4,348 KB |
testcase_62 | AC | 2 ms
4,348 KB |
testcase_63 | AC | 2 ms
4,348 KB |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" void solve(){ int h, w; in(h,w); vector<vector<ll>> a(h+2,vector<ll>(w+2,0)); rep(i,h) rep(j,w) in(a[i+1][j+1]); vector<pii> sides; rep(i,h+2) rep(j,w+2) if (i == 0 || j == 0 || i == h+1 || j == w+1) sides.emplace_back(i,j); vector<tuple<int,int,int,int,ll>> dp; auto way = [&](int x, int y, int xd, int yd){ vector<pii> res; while (range(0,x,h+2) && range(0,y,w+2)){ res.emplace_back(x,y); x += xd, y += yd; } return res; }; for (auto [x, y] : sides) repp(xd,-1,2) repp(yd,-1,2){ if (xd == 0 && yd == 0) continue; auto wy = way(x,y,xd,yd); ll sum = 0; for (auto [p, q] : wy) sum += a[p][q]; dp.push_back({x,y,xd,yd,sum}); } ll ans = 0; for (auto [x1,y1,xd1,yd1,s1] : dp) for (auto [x2,y2,xd2,yd2,s2] : dp){ int det = xd1*yd2 - xd2*yd1; if (det == 0){ if (xd1*(y2-y1) == yd1*(x2-x1)){ chmax(ans,max(s1,s2)); } else { chmax(ans,s1+s2); } } else { int p1 = x1*yd1 - y1*xd1; int p2 = x2*yd2 - y2*xd2; int cx = -xd2 * p1 + xd1 * p2; int cy = -yd2 * p1 + yd1 * p2; int ex = cx / det; int ey = cy / det; ll sum = s1 + s2; if (ex * det == cx && ey * det == cy){ if (range(0,ex,h+2) && range(0,ey,w+2)){ sum -= a[ex][ey]; } } chmax(ans,sum); } } out(ans); } int main(){ int t = 1; //in(t); while (t--) { solve(); } }