#921602 (C++23) No.2509 Beam Shateki

• 問題: No.2509 Beam Shateki
• ユーザー: MMRZ
• 提出日時: 2023-10-21 01:00:37
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,626 ms / 2,000 ms
• コード長: 3,954 bytes
• コンパイル時間: 3,235 ms
• コンパイル使用メモリ: 268,024 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-21 01:47:36
• 合計ジャッジ時間: 46,977 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	226 ms; 5,376 KB
testcase_04	AC	224 ms; 5,376 KB
testcase_05	AC	225 ms; 5,376 KB
testcase_06	AC	229 ms; 5,376 KB
testcase_07	AC	226 ms; 5,376 KB
testcase_08	AC	227 ms; 5,376 KB
testcase_09	AC	222 ms; 5,376 KB
testcase_10	AC	228 ms; 5,376 KB
testcase_11	AC	223 ms; 5,376 KB
testcase_12	AC	227 ms; 5,376 KB
testcase_13	AC	1,573 ms; 5,376 KB
testcase_14	AC	1,554 ms; 5,376 KB
testcase_15	AC	1,563 ms; 5,376 KB
testcase_16	AC	1,568 ms; 5,376 KB
testcase_17	AC	1,543 ms; 5,376 KB
testcase_18	AC	1,536 ms; 5,376 KB
testcase_19	AC	1,566 ms; 5,376 KB
testcase_20	AC	1,551 ms; 5,376 KB
testcase_21	AC	1,626 ms; 5,376 KB
testcase_22	AC	1,618 ms; 5,376 KB
testcase_23	AC	1,607 ms; 5,376 KB
testcase_24	AC	1,599 ms; 5,376 KB
testcase_25	AC	1,579 ms; 6,940 KB
testcase_26	AC	1,582 ms; 6,940 KB
testcase_27	AC	1,592 ms; 6,940 KB
testcase_28	AC	1,570 ms; 6,940 KB
testcase_29	AC	1,585 ms; 6,944 KB
testcase_30	AC	1,562 ms; 6,940 KB
testcase_31	AC	1,570 ms; 6,944 KB
testcase_32	AC	1,549 ms; 6,940 KB
testcase_33	AC	37 ms; 6,940 KB
testcase_34	AC	398 ms; 6,944 KB
testcase_35	AC	801 ms; 6,940 KB
testcase_36	AC	177 ms; 6,944 KB
testcase_37	AC	83 ms; 6,940 KB
testcase_38	AC	198 ms; 6,940 KB
testcase_39	AC	180 ms; 6,944 KB
testcase_40	AC	459 ms; 6,944 KB
testcase_41	AC	6 ms; 6,940 KB
testcase_42	AC	240 ms; 6,940 KB
testcase_43	AC	983 ms; 6,940 KB
testcase_44	AC	1,166 ms; 6,944 KB
testcase_45	AC	164 ms; 6,944 KB
testcase_46	AC	339 ms; 6,944 KB
testcase_47	AC	1,154 ms; 5,376 KB
testcase_48	AC	337 ms; 5,376 KB
testcase_49	AC	560 ms; 5,376 KB
testcase_50	AC	650 ms; 5,376 KB
testcase_51	AC	43 ms; 5,376 KB
testcase_52	AC	442 ms; 5,376 KB
testcase_53	AC	2 ms; 5,376 KB
testcase_54	AC	2 ms; 5,376 KB
testcase_55	AC	2 ms; 5,376 KB
testcase_56	AC	2 ms; 5,376 KB
testcase_57	AC	2 ms; 5,376 KB
testcase_58	AC	2 ms; 5,376 KB
testcase_59	AC	2 ms; 5,376 KB
testcase_60	AC	2 ms; 5,376 KB
testcase_61	AC	2 ms; 5,376 KB
testcase_62	AC	2 ms; 5,376 KB
testcase_63	AC	3 ms; 5,376 KB

ソースコード

# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
template<class T> bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(all((wpwpw)));(wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((int)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
#ifdef LOCAL
#  include "_debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

struct INIT{
    INIT(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        cout << fixed << setprecision(20);
    }
}INIT;

void solve(){
    int h, w;
    cin >> h >> w;
    vector<vector<int>> a(h + 2, vector<int>(w + 2));
    reps(i, h)reps(j, w)cin >> a[i][j];
    ll ans = 0;
    const int dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
    const int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
    auto within = [&](int y, int x) -> bool {
        return 0 <= y && y < h + 2 && 0 <= x && x < w + 2;
    };
    
    vector<pair<int, int>> edge;
    rep(i, h + 1){
        edge.push_back({i, 0});
        edge.push_back({i, w + 1});
    }
    rep(j, w + 1){
        edge.push_back({0, j});
        edge.push_back({h + 1, j});
    }
    sort(all(edge));
    UNIQUE(edge);

    vector<vector<bool>> f1(h + 2, vector<bool>(w + 2));

    for(auto [uy, ux] : edge) {
        rep(dir1, 8){
            ll cur = 0;
            {
                int y = uy, x = ux;
                while(within(y, x)){
                    f1[y][x] = true;
                    cur += a[y][x];
                    y += dy[dir1];
                    x += dx[dir1];
                }
            }
            for(auto [vy, vx] : edge) {
                rep(dir2, 8){
                    ll cur2 = 0;
                    {
                        int y = vy, x = vx;
                        while(within(y, x)){
                            if(not f1[y][x])cur2 += a[y][x];
                            y += dy[dir2];
                            x += dx[dir2];
                        }
                    }
                    chmax(ans, cur + cur2);
                }
            }
            {
                int y = uy, x = ux;
                while(within(y, x)){
                    f1[y][x] = false;
                    y += dy[dir1];
                    x += dx[dir1];
                }
            }
        }
    }

    cout << ans << endl;
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--)solve();
}