結果
問題 | No.1084 積の積 |
ユーザー |
👑 ![]() |
提出日時 | 2020-06-19 21:41:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 236 ms / 2,000 ms |
コード長 | 3,190 bytes |
コンパイル時間 | 2,730 ms |
コンパイル使用メモリ | 206,044 KB |
最終ジャッジ日時 | 2025-01-11 05:58:54 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 27 |
ソースコード
//#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;}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());ll modpow(ll x,ll k,ll m){x%=m;ll now=x,ret=1;while(k){if(k&1)ret=(ret*now)%m;now=(now*now)%m;k>>=1;}return ret;}int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;int n;cin >> n;vector<ll> a(n);rep(i,0,n)cin >> a[i];rep(i,0,n){if(a[i]==0){cout<<0<<endl;return 0;}}map<ll,ll> mp;vector<P> b;ll cnt = 1;rep(i,0,n){if(i == n-1 || a[i] != a[i+1] || a[i] != 1){b.emplace_back(a[i],cnt);cnt = 1;}else cnt++;}ll now = 0;const ll inf = 1e9;rep(i,0,b.size()){now = b[i].first;mp[now] += b[i].second * (b[i].second + 1) / 2;rep(j,i+1,b.size()){now *= b[j].first;if(now >= inf)break;mp[now] += b[i].second * b[j].second;}}res=1;for(auto z:mp){if(z.fi==1)continue;res*=modpow(z.fi,z.se,MOD1);res%=MOD1;}cout<<res<<endl;return 0;}