結果
問題 | No.1084 積の積 |
ユーザー |
![]() |
提出日時 | 2020-06-19 22:01:17 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,730 bytes |
コンパイル時間 | 1,748 ms |
コンパイル使用メモリ | 172,400 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-03 14:35:31 |
合計ジャッジ時間 | 3,407 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 RE * 1 |
other | AC * 14 WA * 10 RE * 3 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;const lint inf = 1LL << 60;const lint mod = 1000000007;template <int mod>struct modint {lint v;modint() : v(0) {}modint(signed v) : v(v) {}modint(lint t) {v = t % mod;if (v < 0)v += mod;}modint pow(lint k) {modint res(1), tmp(v);while (k) {if (k & 1)res *= tmp;tmp *= tmp;k >>= 1;}return res;}static modint add_identity() { return modint(0); }static modint mul_identity() { return modint(1); }modint inv() { return pow(mod - 2); }modint &operator+=(modint a) {v += a.v;if (v >= mod)v -= mod;return *this;}modint &operator-=(modint a) {v += mod - a.v;if (v >= mod)v -= mod;return *this;}modint &operator*=(modint a) {v = v * a.v % mod;return *this;}modint &operator/=(modint a) { return (*this) *= a.inv(); }modint operator+(modint a) const { return modint(v) += a; };modint operator-(modint a) const { return modint(v) -= a; };modint operator*(modint a) const { return modint(v) *= a; };modint operator/(modint a) const { return modint(v) /= a; };modint operator-() const { return v ? modint(mod - v) : modint(v); }bool operator==(const modint a) const { return v == a.v; }bool operator!=(const modint a) const { return v != a.v; }bool operator<(const modint a) const { return v < a.v; }};using mint = modint<mod>;ostream &operator<<(ostream &os, mint m) { return os << m.v; }int main() {cin.tie(nullptr);ios::sync_with_stdio(false);lint n;cin >> n;vector<lint> a(n);for (int i = 0; i < n; ++i) {cin >> a[i];}lint curr = 1;lint l = 0;vector<int> ri(n + 1, 0), ri2(n + 1, 0);for (int i = 0; i < n; ++i) {while (l < n && curr < 1000000000) {curr *= a[l];l++;}if (curr >= 1000000000) {if (i)ri2[i - 1] -= (n - 1 - (l - 2));ri[l - 2]--;ri[n - 1]++;}curr /= a[i];}for (int i = n - 1; i >= 0; --i) {ri[i] += ri[i + 1];ri2[i] += ri2[i + 1];}for (int i = n - 1; i >= 0; --i) {ri[i] += ri[i + 1];}mint ret = 1;for (int i = 0; i < n; ++i) {ret *= mint(a[i]).pow((i + 1) * (n - i) - ri[i] - ri2[i]);}// for (int i = 0; i < n; ++i) {// ret /= mint(a[i]).pow(ri[i] + ri2[i]);// }cout << ret << "\n";return 0;}