#924062 (C++17) No.2509 Beam Shateki

提出ソース

結果

問題	No.2509 Beam Shateki
ユーザー	jabee
提出日時	2023-10-28 12:00:06
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	5,767 bytes
コンパイル時間	5,167 ms
コンパイル使用メモリ	294,016 KB
実行使用メモリ	20,664 KB
最終ジャッジ日時	2023-10-28 12:00:27
合計ジャッジ時間	20,517 ms
ジャッジサーバーID （参考情報）	judge15 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	29 ms 18,960 KB
testcase_01	AC	29 ms 18,960 KB
testcase_02	AC	28 ms 18,960 KB
testcase_03	AC	1,044 ms 20,664 KB
testcase_04	AC	1,039 ms 20,664 KB
testcase_05	AC	1,040 ms 20,664 KB
testcase_06	AC	1,040 ms 20,664 KB
testcase_07	AC	1,022 ms 20,664 KB
testcase_08	AC	1,037 ms 20,664 KB
testcase_09	AC	1,031 ms 20,664 KB
testcase_10	AC	1,042 ms 20,664 KB
testcase_11	AC	1,040 ms 20,664 KB
testcase_12	AC	1,032 ms 20,664 KB
testcase_13	TLE	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-
testcase_46	--	-
testcase_47	--	-
testcase_48	--	-
testcase_49	--	-
testcase_50	--	-
testcase_51	--	-
testcase_52	--	-
testcase_53	--	-
testcase_54	--	-
testcase_55	--	-
testcase_56	--	-
testcase_57	--	-
testcase_58	--	-
testcase_59	--	-
testcase_60	--	-
testcase_61	--	-
testcase_62	--	-
testcase_63	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
using atmint = modint998244353;
//using atmint = modint;
//atmint::set_mod(m);
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
 
//---------------------------------------------------------------------------------------------------
 
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
typedef ModInt<1000000007> mint;
//typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------
void _main() {
  ll h,w;
  cin >> h >> w;
  vector a(h+2,vector<ll>(w+2,0));
  rep(i,1,h+1)rep(j,1,w+1)cin >> a[i][j];
  vector<ll>d = {-1,0,1};
  vector<P>slist;
  rep(si,0,h+2)slist.push_back({si,0});
  rep(si,0,h+2)slist.push_back({si,w+1});
  rep(sj,0,w+2)slist.push_back({0,sj});
  rep(sj,0,w+2)slist.push_back({h+1,sj});
  vector setlist(slist.size(),vector(d.size(),vector<unordered_set<ll>>(d.size())));
  vector scorelist(slist.size(),vector(d.size(),vector<ll>(d.size())));
  ll ans = 0;
  rep(sl1,0,slist.size()){
    ll si1 = slist[sl1].first;
    ll sj1 = slist[sl1].second;    
    rep(dir1,0,d.size())rep(dir2,0,d.size()){
    if(d[dir1] == 0 && d[dir2] == 0)continue;
    unordered_set<ll>oriused;
    ll oritemp = 0;
    ll i = si1;
    ll j = sj1;
    while(0 <= i && i <= h+1 && 0 <= j && j <= w+1){
      if(!oriused.count(i*1000+j))oritemp += a[i][j];
      oriused.insert(i*1000+j);
      i += d[dir1];
      j += d[dir2];
    }
    setlist[sl1][dir1][dir2] = oriused;
    scorelist[sl1][dir1][dir2] = oritemp;
    chmax(ans,oritemp);
   }
  }
  rep(sl1,0,slist.size()){
  rep(sl2,0,slist.size()){
    if(sl1 == sl2)continue;
    rep(dir1,0,d.size())rep(dir2,0,d.size()){
      if(d[dir1] == 0 && d[dir2] == 0)continue;
    rep(dir3,0,d.size())rep(dir4,0,d.size()){
      if(d[dir3] == 0 && d[dir4] == 0)continue;
      ll temp = scorelist[sl1][dir1][dir2];
      temp += scorelist[sl2][dir3][dir4];
      for(auto p:setlist[sl1][dir1][dir2]){
        if(setlist[sl2][dir3][dir4].count(p)){
          ll i = p / 1000;
          ll j = p % 1000;
          temp -= a[i][j];
        }
      }
      chmax(ans,temp);
    }
    }
  }
  }
  cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード