結果

問題 No.1334 Multiply or Add
ユーザー n_vipn_vip
提出日時 2021-01-08 22:29:08
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 8,009 bytes
コンパイル時間 1,568 ms
コンパイル使用メモリ 145,232 KB
実行使用メモリ 17,272 KB
最終ジャッジ日時 2023-08-10 10:27:17
合計ジャッジ時間 8,966 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
16,212 KB
testcase_01 AC 52 ms
16,272 KB
testcase_02 AC 50 ms
16,092 KB
testcase_03 AC 62 ms
17,116 KB
testcase_04 AC 64 ms
17,100 KB
testcase_05 AC 63 ms
17,080 KB
testcase_06 AC 64 ms
17,112 KB
testcase_07 AC 62 ms
17,092 KB
testcase_08 AC 62 ms
17,056 KB
testcase_09 AC 61 ms
17,272 KB
testcase_10 AC 64 ms
17,048 KB
testcase_11 AC 62 ms
16,996 KB
testcase_12 AC 61 ms
17,176 KB
testcase_13 AC 60 ms
17,024 KB
testcase_14 AC 61 ms
17,056 KB
testcase_15 AC 59 ms
16,992 KB
testcase_16 AC 62 ms
17,064 KB
testcase_17 AC 62 ms
17,044 KB
testcase_18 AC 63 ms
17,020 KB
testcase_19 AC 61 ms
17,152 KB
testcase_20 AC 60 ms
17,268 KB
testcase_21 AC 61 ms
17,024 KB
testcase_22 AC 59 ms
17,244 KB
testcase_23 AC 62 ms
17,124 KB
testcase_24 AC 59 ms
16,992 KB
testcase_25 AC 60 ms
17,064 KB
testcase_26 AC 59 ms
17,092 KB
testcase_27 AC 60 ms
17,020 KB
testcase_28 AC 61 ms
17,172 KB
testcase_29 AC 62 ms
16,988 KB
testcase_30 AC 60 ms
17,060 KB
testcase_31 AC 61 ms
17,192 KB
testcase_32 AC 62 ms
16,956 KB
testcase_33 AC 60 ms
17,016 KB
testcase_34 AC 61 ms
17,248 KB
testcase_35 AC 61 ms
16,956 KB
testcase_36 AC 60 ms
17,080 KB
testcase_37 AC 60 ms
17,108 KB
testcase_38 AC 58 ms
17,032 KB
testcase_39 AC 50 ms
16,056 KB
testcase_40 AC 55 ms
16,576 KB
testcase_41 AC 50 ms
16,332 KB
testcase_42 AC 52 ms
16,568 KB
testcase_43 AC 57 ms
16,756 KB
testcase_44 AC 52 ms
16,512 KB
testcase_45 AC 50 ms
16,212 KB
testcase_46 AC 54 ms
16,448 KB
testcase_47 AC 57 ms
16,840 KB
testcase_48 AC 51 ms
16,656 KB
testcase_49 AC 61 ms
16,900 KB
testcase_50 AC 72 ms
17,132 KB
testcase_51 AC 74 ms
17,180 KB
testcase_52 AC 73 ms
16,992 KB
testcase_53 AC 73 ms
17,004 KB
testcase_54 AC 73 ms
17,076 KB
testcase_55 AC 75 ms
16,952 KB
testcase_56 AC 50 ms
16,336 KB
testcase_57 AC 50 ms
15,988 KB
testcase_58 AC 52 ms
16,172 KB
testcase_59 AC 50 ms
16,216 KB
testcase_60 AC 51 ms
16,024 KB
testcase_61 AC 50 ms
16,020 KB
testcase_62 AC 50 ms
16,268 KB
testcase_63 AC 50 ms
16,024 KB
testcase_64 AC 52 ms
16,264 KB
testcase_65 AC 51 ms
16,096 KB
testcase_66 AC 68 ms
16,860 KB
testcase_67 AC 63 ms
16,632 KB
testcase_68 AC 50 ms
16,032 KB
testcase_69 AC 73 ms
16,984 KB
testcase_70 AC 71 ms
16,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// https://codeforces.com/contest/1461/problem/F
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return move(re);}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;

ll modpow_(ll r,ll n,ll m=MOD){
  ll re=1,d=r%m;
  if(n<0)(n%=m-1)+=m-1;
  for(;n;n/=2){
    if(n&1)(re*=d)%=m;
    (d*=d)%=m;
  }
  return re;
}
template <int mod=MOD> struct ModInt{
  int v;
  ModInt(int v=0):v(v){}
  ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}
  ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}
  ModInt operator*(const ModInt &n)const{return ll(v)*n.v%mod;}
  ModInt operator/(const ModInt &n)const{return ll(v)*modpow_(n.v%mod,-1,mod)%mod;}
  ModInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}
  ModInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}
  ModInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}
  ModInt operator/(const ll &n)const{return ll(v)*modpow_(n%mod,-1,mod)%mod;}
  ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}
  ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;}
  ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;}
  ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;}
  ModInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}
  ModInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}
  ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}
  ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;}
	bool operator==(const ModInt &n)const{return v==n.v;};
	bool operator!=(const ModInt &n)const{return v!=n.v;};
	ModInt& operator++(){ return operator+=(1); }
	ModInt& operator--(){ return operator-=(1); }
	ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; }
	ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; }
};
#ifdef NUIP
class MINT_FRAC____{
public:
	unordered_map<int,pii> dict;
	MINT_FRAC____(int n){
		rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){
			dict[1ll*p*modpow_(q,-1)%MOD]=pii(p,q);
			dict[MOD-1ll*p*modpow_(q,-1)%MOD]=pii(-p,q);
		}
	}
} Il1Il1Il1(1000);
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;};
#else
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;};
#endif
template<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}
template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}
template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;}
template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;}
typedef ModInt<MOD> mint;
template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}
vector<mint> fact,finv,inv;
mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}
class Doralion{
  void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}
  void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}
  void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}
public:
  Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}
} doralion(1123456);
using pmm=pair<mint,mint>;
mint modpow(ll r,ll n){ return modpow_(r,n);}


int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout<<fixed<<setprecision(0);
	cauto n=read();
	cauto vs=readV(n,0);
	cauto s="*+"s;
	cauto minu=count(all(s),'-');
	cauto plus=count(all(s),'+');
	cauto mult=count(all(s),'*');
	cauto solve=
		[&](const vector<int> &vs)->mint{
			if(vs.empty()) return 0;
			if(count(all(vs),1)==vs.size()){
				return (mint)vs.size();
			}
			ll prod=1;
			for(cauto v:vs) MN(prod*=v,MOD);
			if(prod==MOD){
				mint prod=1;
				for(cauto v:vs) prod*=v;
				int l=0;
				while(vs[l]==1) ++l, prod+=1;
				int r=vs.size();
				while(vs[r-1]==1) --r, prod+=1;;
				return prod;
			}
			vector<pll> ps;
			vector<int> ind;
			rep(i,vs.size()){
				cauto v=vs[i];
				if(ps.empty() || ps.back().X!=(v==1)) ps.eb(v==1,v!=1), ind.eb(i);
				if(v==1) ++ps.back().Y;
				else MN(ps.back().Y*=v,MOD);
			}
			ind.eb(vs.size());
			out(ps,ind,1);
			cauto n=(int)ps.size();
			vector<pll> dp(n+1);
			rep(i,n){
				ll p=1;
				reps(j,i,n){
					if(ps[j].X==0) p*=ps[j].Y;
					MX(dp[j+1],pll(dp[i].X+p,i));
				}
				if(ps[i].X)	MX(dp[i+1],pll(dp[i].X+ps[i].Y,n));
			}
			out(dp,1);
			mint re=0;
			for(int i=n;i;){
				cauto t=dp[i].Y;
				if(t==n){
					--i;
					rep(_,ps[i].Y) re+=1;
				}else{
					mint prod=1;
					rreps(j,ind[t],ind[i]) prod*=vs[j];
					re+=prod;
					i=t;
				}
				out(i,re,1);
			}
			return re;
		};
	cout<<solve(vs) NL;
  return 0;
}
0