結果
問題 | No.1084 積の積 |
ユーザー |
![]() |
提出日時 | 2020-06-19 22:35:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 3,801 bytes |
コンパイル時間 | 2,451 ms |
コンパイル使用メモリ | 199,720 KB |
最終ジャッジ日時 | 2025-01-11 07:10:21 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)#define all(x) (x).begin(), (x).end()#define sz(x) int(x.size())#define get_unique(x) x.erase(unique(all(x)), x.end());typedef long long ll;typedef complex<double> Complex;const ll INF = 1e9;const ll MOD = 1e9 + 7;const ll LINF = 1e18;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 <class T>vector<T> make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>auto make_vec(size_t a, Ts... ts) {return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}template <typename T>ostream& operator<<(ostream& os, vector<T> v) {for (int i = 0; i < sz(v); i++) {os << v[i];if (i < sz(v) - 1) os << " ";}return os;}struct modint {ll x;modint(ll x = 0) : x((x % MOD + MOD) % MOD) {}ll value() const {return x;}modint operator-() const {return modint(-x);}modint& operator+=(const modint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}modint& operator-=(const modint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}modint& operator*=(const modint a) {(x *= a.x) %= MOD;return *this;}modint operator+(const modint a) const {modint res(*this);return res += a;}modint operator-(const modint a) const {modint res(*this);return res -= a;}modint operator*(const modint a) const {modint res(*this);return res *= a;}modint pow(ll t) const {if (t == 0) return 1;modint a = pow(t >> 1);a *= a;if (t % 2 == 1) a *= *this;return a;}modint inv() const {return pow(MOD - 2);}modint& operator/=(const modint a) {return (*this) *= a.inv();}modint operator/(const modint a) const {modint res(*this);return res /= a;}};ostream& operator<<(ostream& os, const modint& x) {os << x.value();return os;}struct combination {vector<modint> fact, ifact;combination(int n) : fact(n + 1), ifact(n + 1) {assert(n < MOD);fact[0] = 1;for (int i = 1; i <= n; i++) {fact[i] = fact[i - 1] * i;}ifact[n] = fact[n].inv();for (int i = n; i >= 1; i--) {ifact[i - 1] = ifact[i] * i;}}modint operator()(int n, int k) {if (n < k || k < 0) return 0;return fact[n] * ifact[k] * ifact[n - k];}modint h(int n, int k) {n += k - 1;if (k < 0 || k > n) return 0;return fact[n] * ifact[k] * ifact[n - k];}} comb(2002002);int main() {int n;cin >> n;vector<ll> a(n);rep(i, n) cin >> a[i];if(*min_element(all(a))==0) {cout << 0 << endl;return 0;}int right = 0;ll x = 1;vector<ll> r(n);rep(left, n) {while (right < n && x * a[right] < INF) {x *= a[right];right++;}r[left] = (ll)right;if (right == left)right++;elsex /= a[left];}vector<ll> v(n + 2);rep(i, n) {v[i + 1]--;v[r[i] + 1]++;}rep(i, n) v[i + 1] += v[i];rep(i, n) v[i] += (r[i] - (ll)i);rep(i, n) v[i + 1] += v[i];modint ans = 1;rep(i, n) ans *= modint(a[i]).pow(v[i]);cout << ans << endl;}