#601177 (C++17) No.1334 Multiply or Add

提出ソース

結果

問題	No.1334 Multiply or Add
ユーザー	👑 tute7627
提出日時	2021-01-08 22:27:05
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	25 ms / 2,000 ms
コード長	6,474 bytes
コンパイル時間	2,406 ms
コンパイル使用メモリ	207,644 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-16 13:13:30
合計ジャッジ時間	5,282 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	13 ms 5,248 KB
testcase_04	AC	14 ms 5,248 KB
testcase_05	AC	13 ms 5,248 KB
testcase_06	AC	12 ms 5,248 KB
testcase_07	AC	13 ms 5,248 KB
testcase_08	AC	13 ms 5,248 KB
testcase_09	AC	13 ms 5,248 KB
testcase_10	AC	13 ms 5,248 KB
testcase_11	AC	13 ms 5,248 KB
testcase_12	AC	13 ms 5,248 KB
testcase_13	AC	13 ms 5,248 KB
testcase_14	AC	13 ms 5,248 KB
testcase_15	AC	13 ms 5,248 KB
testcase_16	AC	13 ms 5,248 KB
testcase_17	AC	13 ms 5,248 KB
testcase_18	AC	14 ms 5,248 KB
testcase_19	AC	13 ms 5,248 KB
testcase_20	AC	13 ms 5,248 KB
testcase_21	AC	13 ms 5,248 KB
testcase_22	AC	13 ms 5,248 KB
testcase_23	AC	14 ms 5,248 KB
testcase_24	AC	13 ms 5,248 KB
testcase_25	AC	14 ms 5,248 KB
testcase_26	AC	13 ms 5,248 KB
testcase_27	AC	13 ms 5,248 KB
testcase_28	AC	13 ms 5,248 KB
testcase_29	AC	14 ms 5,248 KB
testcase_30	AC	13 ms 5,248 KB
testcase_31	AC	13 ms 5,248 KB
testcase_32	AC	14 ms 5,248 KB
testcase_33	AC	13 ms 5,248 KB
testcase_34	AC	13 ms 5,248 KB
testcase_35	AC	13 ms 5,248 KB
testcase_36	AC	13 ms 5,248 KB
testcase_37	AC	13 ms 5,248 KB
testcase_38	AC	13 ms 5,248 KB
testcase_39	AC	2 ms 5,248 KB
testcase_40	AC	6 ms 5,248 KB
testcase_41	AC	3 ms 5,248 KB
testcase_42	AC	4 ms 5,248 KB
testcase_43	AC	11 ms 5,248 KB
testcase_44	AC	6 ms 5,248 KB
testcase_45	AC	3 ms 5,248 KB
testcase_46	AC	7 ms 5,248 KB
testcase_47	AC	9 ms 5,248 KB
testcase_48	AC	7 ms 5,248 KB
testcase_49	AC	12 ms 5,248 KB
testcase_50	AC	25 ms 5,248 KB
testcase_51	AC	24 ms 5,248 KB
testcase_52	AC	24 ms 5,248 KB
testcase_53	AC	24 ms 5,248 KB
testcase_54	AC	24 ms 5,248 KB
testcase_55	AC	25 ms 5,248 KB
testcase_56	AC	2 ms 5,248 KB
testcase_57	AC	2 ms 5,248 KB
testcase_58	AC	2 ms 5,248 KB
testcase_59	AC	2 ms 5,248 KB
testcase_60	AC	2 ms 5,248 KB
testcase_61	AC	1 ms 5,248 KB
testcase_62	AC	2 ms 5,248 KB
testcase_63	AC	2 ms 5,248 KB
testcase_64	AC	2 ms 5,248 KB
testcase_65	AC	2 ms 5,248 KB
testcase_66	AC	20 ms 5,248 KB
testcase_67	AC	14 ms 5,248 KB
testcase_68	AC	2 ms 5,248 KB
testcase_69	AC	23 ms 5,248 KB
testcase_70	AC	21 ms 5,248 KB

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) += rhs;
  }
  friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) -= rhs;
  }
  friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) *= rhs;
  }
  friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) /= rhs;
  }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(ll sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(ll i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(ll i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(ll i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(ll k) const { return _fact[k]; }

  inline T rfact(ll k) const { return _rfact[k]; }

  inline T inv(ll k) const { return _inv[k]; }

  T P(ll n, ll r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(ll p, ll q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
  
  T RC(ll p, ll q) const {
    if(q < 0 || p < q) return 0;
    return rfact(p) * fact(q) * fact(p - q);
  }

  T H(ll n, ll r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
using modint = ModInt< MOD1 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}
//using modint=ld;
using Comb=Combination<modint>;


int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  ll mul=1;
  ll inf=1e9;
  rep(i,0,n){
    mul=min(inf,mul*a[i]);
  }
  if(mul==inf){
    ll l=0,r=n-1;
    while(a[l]==1)l++;
    while(a[r]==1)r--;
    modint ret=1;
    rep(i,l,r+1)ret*=a[i];
    ret+=l+(n-1-r);
    cout<<ret<<endl;
    return 0;
  }
  vector<ll>idx;
  rep(i,0,n)if(a[i]!=1)idx.PB(i);
  ll sz=idx.size();
  if(sz==0){
    cout<<n<<endl;
    return 0;
  }
  vector<ll>dp(sz+1);
  dp[0]=idx[0];
  idx.PB(n);
  rep(i,0,sz){
    ll mul=1;
    rep(j,i+1,sz+1){
      mul*=a[idx[j-1]];
      chmax(dp[j],dp[i]+mul+idx[j]-idx[j-1]-1);
    }
  }
  //debug(dp,sz+1);
  cout<<modint(dp[sz])<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード