結果
| 問題 | No.1084 積の積 |
| ユーザー |
 Mayimg
|
| 提出日時 | 2020-07-03 19:26:54 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 37 ms / 2,000 ms |
| コード長 | 9,604 bytes |
| コンパイル時間 | 4,956 ms |
| コンパイル使用メモリ | 195,624 KB |
| 最終ジャッジ日時 | 2025-01-11 14:09:25 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 27 |
ソースコード
#define _USE_MATH_DEFINES#include <bits/stdc++.h>using namespace std;template<typename T> class Modular {private:long long value;constexpr static int MOD() { return static_cast<int>(T::value); }public:constexpr Modular() : value() {};constexpr Modular(const Modular& other) : value(other.value) {}template <typename U> constexpr Modular(const U& x) { value = normalize(x); }template <typename U> static long long normalize(const U& x) {long long v;if (-MOD() <= x && x < MOD()) v = static_cast<long long>(x);else v = static_cast<long long>(x % MOD());if (v < 0) v += MOD();return v;}constexpr static long long inverse(long long x) {x = (x % MOD() + MOD()) % MOD();long long y = MOD(), u = 1, v = 0;while(y) {long long t = x / y;x -= t * y; swap(x, y);u -= t * v; swap(u, v);}return (u % MOD() + MOD()) % MOD();}static long long mul(const long long& a, const long long& b) {long long res;#ifdef _WIN32unsigned long long x = a * b;unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;asm("divl %4; \n\t": "=a" (d), "=d" (m): "d" (xh), "a" (xl), "r" (MOD()));res = m;#elseres = a * b % MOD();#endifreturn res;}explicit operator long long() const noexcept { return value;}template <typename U> explicit operator U() const noexcept { return static_cast<U>(value); }constexpr Modular& operator=(const Modular& other) & noexcept { value = other.value; return *this; }template <typename U> constexpr Modular& operator=(const U& other) & noexcept { return *this = Modular(other); }constexpr Modular& operator+=(const Modular& other) noexcept { if ((value += other.value) >= MOD()) value -= MOD(); return *this; }template <typename U> constexpr Modular& operator+=(const U& other) noexcept { return *this += Modular(other); }constexpr Modular& operator-=(const Modular& other) noexcept { if ((value -= other.value) < 0) value += MOD(); return *this; }template <typename U> constexpr Modular& operator-=(const U& other) noexcept { return *this -= Modular(other); }constexpr Modular& operator*=(const Modular& other) noexcept { this->value = mul(this->value, other.value); return *this; }template <typename U> constexpr Modular& operator*=(const U& other) noexcept {return *this *= Modular(other); }constexpr Modular& operator/=(const Modular& other) noexcept { return *this *= Modular(inverse(other.value)); }template <typename U> constexpr Modular& operator/=(const U& other) noexcept { return *this *= Modular(inverse(normalize(other))); }constexpr Modular& operator++() noexcept {return *this += 1; }constexpr Modular operator++(int) noexcept { Modular ret(*this); *this += 1; return ret; }constexpr Modular& operator--() noexcept {return *this -= 1; }constexpr Modular operator--(int) noexcept { Modular ret(*this); *this -= 1; return ret; }constexpr Modular operator-() const { return Modular(-value); }friend constexpr bool operator==(const Modular& lhs, const Modular<T>& rhs) noexcept { return lhs.value == rhs.value; }template <typename U> friend constexpr bool operator==(const Modular<T>& lhs, U rhs) noexcept { return lhs == Modular<T>(rhs); }template <typename U> friend constexpr bool operator==(U lhs, const Modular<T>& rhs) noexcept { return Modular<T>(lhs) == rhs; }friend constexpr bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return !(lhs == rhs); }template <typename U> friend constexpr bool operator!=(const Modular<T>& lhs, U rhs) noexcept { return !(lhs == rhs); }template <typename U> friend constexpr bool operator!=(U lhs, const Modular<T> rhs) noexcept { return !(lhs == rhs); }friend constexpr bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return lhs.value < rhs.value; }template <typename U> friend constexpr bool operator<(const Modular<T> &lhs, U rhs) noexcept { return lhs.value < rhs; }template <typename U> friend constexpr bool operator<(U lhs, const Modular<T> &rhs) noexcept { return lhs < rhs.value; }friend constexpr bool operator>(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return rhs.value < lhs.value; }template <typename U> friend constexpr bool operator>(const Modular<T> &lhs, U rhs) noexcept { return rhs.value < lhs; }template <typename U> friend constexpr bool operator>(U lhs, const Modular<T> &rhs) noexcept { return rhs < lhs.value; }friend constexpr bool operator<=(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return !(lhs.value > rhs.value); }template <typename U> friend constexpr bool operator<=(const Modular<T> &lhs, U rhs) noexcept { return !(lhs.value > rhs); }template <typename U> friend constexpr bool operator<=(U lhs, const Modular<T> &rhs) noexcept { return !(lhs < rhs.value); }friend constexpr bool operator>=(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return !(lhs.value < rhs.value); }template <typename U> friend constexpr bool operator>=(const Modular<T> &lhs, U rhs) noexcept { return !(lhs.value < rhs); }template <typename U> friend constexpr bool operator>=(U lhs, const Modular<T> &rhs) noexcept { return !(lhs < rhs.value); }friend constexpr Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return Modular<T>(lhs) += rhs; }template <typename U> friend constexpr Modular<T> operator+(const Modular<T>& lhs, U rhs) noexcept { return Modular<T>(lhs) += rhs; }template <typename U> friend constexpr Modular<T> operator+(U lhs, const Modular<T> &rhs) noexcept { return Modular<T>(lhs) += rhs; }friend constexpr Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return Modular<T>(lhs) -= rhs; }template <typename U> friend constexpr Modular<T> operator-(const Modular<T>& lhs, U rhs) noexcept { return Modular<T>(lhs) -= rhs; }template <typename U> friend constexpr Modular<T> operator-(U lhs, const Modular<T> &rhs) noexcept { return Modular<T>(lhs) -= rhs; }friend constexpr Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return Modular<T>(lhs) *= rhs; }template <typename U> friend constexpr Modular<T> operator*(const Modular<T>& lhs, U rhs) noexcept { return Modular<T>(lhs) *= rhs; }template <typename U> friend constexpr Modular<T> operator*(U lhs, const Modular<T> &rhs) noexcept { return Modular<T>(lhs) *= rhs; }friend constexpr Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) noexcept { return Modular<T>(lhs) /= rhs; }template <typename U> friend constexpr Modular<T> operator/(const Modular<T>& lhs, U rhs) noexcept { return Modular<T>(lhs) /= rhs; }template <typename U> friend constexpr Modular<T> operator/(U lhs, const Modular<T> &rhs) noexcept { return Modular<T>(lhs) /= rhs; }friend std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) noexcept { return stream << number.value; }friend std::istream& operator>>(std::istream& stream, Modular<T>& number) { long long in; stream >> in; number.value = Modular<T>::normalize(in);return stream; }constexpr int getmod() const { return MOD(); }};template<typename T, typename U> Modular<T> power(const Modular<T>& x, const U& y) {assert(y >= 0);Modular<T> k = x, result = 1;U p = y;while (p > 0) {if (p & 1) result *= k;k *= k;p >>= 1;}return result;}template<typename T> class BinaryCoefficients {private:vector<Modular<T>> fact_, inv_, finv_;long long MOD = static_cast<long long>(T::value);public:constexpr BinaryCoefficients(int n = 2020200) : fact_(n, 1), inv_(n, 1), finv_(n, 1) {for (int i = 2; i < n; i++) {fact_[i] = fact_[i - 1] * i;inv_[i] = -inv_[MOD % i] * (MOD / i);finv_[i] = finv_[i - 1] * inv_[i];}}constexpr Modular<T> comb(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n - k]; }constexpr Modular<T> fact(int n) const noexcept { if (n < 0) return 0; return fact_[n]; }constexpr Modular<T> inv(int n) const noexcept { if (n < 0) return 0; return inv_[n]; }constexpr Modular<T> finv(int n) const noexcept { if (n < 0) return 0; return finv_[n]; }};constexpr int mod = 1e9 + 7;//constexpr int mod = 998244353;using mint = Modular<std::integral_constant<decay<decltype(mod)>::type, mod>>;using bicoef = BinaryCoefficients<std::integral_constant<decay<decltype(mod)>::type, mod>>;// struct modValue { static int value; };// int modValue::value;// int& mod = modValue::value;// using mint = Modular<modValue>;// using bicoef = BinaryCoefficients<modValue>;const int LIMIT = 1e9;signed main() {ios::sync_with_stdio(false); cin.tie(0);int n;cin >> n;vector<long long> a(n);for (int i = 0; i < n; i++) {cin >> a[i];if (a[i] == 0) {cout << 0 << endl;return 0;}}vector<long long> imos2(n + 2), imos(n + 2);long long cur = 1;for (int i = 0, j = 0; i < n; i++) {while (j < n && cur * a[j] < LIMIT) {cur *= a[j];j++;}imos[i + 1]--;imos[j]++;int len = j - i;imos2[i] += len;imos2[j] -= 1;cur /= a[i];}for (int i = 1; i < n + 2; i++) imos[i] += imos[i - 1];for (int i = 0; i < n + 2; i++) imos[i] += imos2[i];for (int i = 1; i < n + 2; i++) imos[i] += imos[i - 1];mint ans = 1;for (int i = 0; i < n; i++) {ans *= power(mint(a[i]), imos[i]);}cout << ans << endl;return 0;}