結果
問題 | No.1084 積の積 |
ユーザー | もりを |
提出日時 | 2020-06-19 22:25:18 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 407 ms / 2,000 ms |
コード長 | 15,265 bytes |
コンパイル時間 | 2,325 ms |
コンパイル使用メモリ | 219,348 KB |
実行使用メモリ | 8,576 KB |
最終ジャッジ日時 | 2024-07-03 15:01:47 |
合計ジャッジ時間 | 8,756 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 405 ms
8,576 KB |
testcase_05 | AC | 7 ms
6,940 KB |
testcase_06 | AC | 407 ms
8,448 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 13 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 8 ms
6,940 KB |
testcase_12 | AC | 122 ms
6,940 KB |
testcase_13 | AC | 287 ms
8,064 KB |
testcase_14 | AC | 87 ms
6,944 KB |
testcase_15 | AC | 79 ms
6,940 KB |
testcase_16 | AC | 335 ms
8,448 KB |
testcase_17 | AC | 111 ms
6,940 KB |
testcase_18 | AC | 200 ms
6,944 KB |
testcase_19 | AC | 291 ms
7,936 KB |
testcase_20 | AC | 52 ms
6,940 KB |
testcase_21 | AC | 88 ms
6,944 KB |
testcase_22 | AC | 64 ms
6,940 KB |
testcase_23 | AC | 158 ms
6,944 KB |
testcase_24 | AC | 142 ms
6,940 KB |
testcase_25 | AC | 287 ms
8,064 KB |
testcase_26 | AC | 336 ms
8,448 KB |
testcase_27 | AC | 335 ms
8,448 KB |
testcase_28 | AC | 335 ms
8,448 KB |
testcase_29 | AC | 341 ms
8,448 KB |
testcase_30 | AC | 335 ms
8,320 KB |
testcase_31 | AC | 336 ms
8,448 KB |
ソースコード
// #pragma GCC target ("avx") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> using namespace std; #define int long long // #define endl '\n' #pragma region TEMPLATE /* TYPE */ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<string> vst; typedef vector<bool> vb; typedef vector<ld> vld; typedef vector<vector<int>> vvi; template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>; template<typename T> using prique_r = prique<T, greater<>>; /* CONSTANT */ #define ln '\n' const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288; const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 }; const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 }; /* CONTAINER */ #define PB emplace_back #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define SORT(v) sort(ALL(v)) #define RSORT(v) sort(RALL(v)) #define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin()) #define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin()) #define GREATER(x, val) (int)(x).size() - LEQ((x), (val)) #define GEQ(x, val) (int)(x).size() - LESS((x), (val)) #define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end()) template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); } template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); } template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); } template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); } /* LOOP */ #define _overload3(_1, _2, _3, name, ...) name #define _REP(i, n) REPI(i, 0, n) #define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i) #define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__) #define _RREP(i, n) RREPI(i, n, 0) #define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i) #define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__) #define EACH(e, v) for (auto& e : v) #define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v))) /* INPUT */ template<typename T> void SSS(T& t) { cin >> t; } template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); } #define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__); #define SV(T, v, n) vector<T> v(n); for (auto& i : v) cin >> i; #define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i; /* OUTPUT */ // Yes / No inline int YES(bool x) { cout << (x ? "YES" : "NO") << endl; return 0; } inline int Yes(bool x) { cout << (x ? "Yes" : "No") << endl; return 0; } inline int yes(bool x) { cout << (x ? "yes" : "no") << endl; return 0; } inline int yES(bool x) { cout << (x ? "yES" : "nO") << endl; return 0; } inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; } // PROTOTYPE DECLARATION template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j); template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t); template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c); template<typename T> ostream &operator<<(ostream &os, const stack<T> &j); template<typename T> ostream &operator<<(ostream &os, const queue<T> &j); template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j); // IMPLEMENTATION template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; } template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {} template<size_t num = 0, typename... T> enable_if_t<num < sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); } template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; } template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; } template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; } template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } // OUTPUT FUNCTION template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; } inline int print() { cout << endl; return 0; } template<typename Head> int print(Head&& head){ cout << head; return print(); } template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); } #ifdef LOCAL inline void dump() { cerr << endl; } template<typename Head> void dump(Head&& head) { cerr << head; dump(); } template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); } #define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false) #else #define dump(...) #define debug(...) #endif /* OTHER */ #define fi first #define se second #define MP make_pair #define MT make_tuple #define tmax(x, y, z) max((x), max((y), (z))) #define tmin(x, y, z) min((x), min((y), (z))) template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); } template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; } inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; } struct abracadabra { abracadabra() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(5); }; } ABRACADABRA; #pragma endregion #pragma region math modint /** * @brief ModInt * @docs docs/math/modint.md */ template< int MODULO > struct ModInt { using i32 = int; using i64 = long long; using u32 = unsigned int; using u64 = unsigned long long; u64 x; ModInt() : x(0) {} ModInt(i64 y) : x(set(y % MODULO + MODULO)) {} static u64 set(const i64 &y) { return (y < MODULO) ? y : y - MODULO; } ModInt operator+(const ModInt &m) const { return ModInt(set(x + m.x)); } ModInt operator-(const ModInt &m) const { return ModInt(set(x + MODULO - m.x)); } ModInt operator*(const ModInt &m) const { return ModInt(x * m.x % MODULO); } ModInt operator/(const ModInt &m) const { return ModInt(x) * ~ModInt(m.x); } ModInt &operator+=(const ModInt &m) { return *this = *this + m; } ModInt &operator-=(const ModInt &m) { return *this = *this - m; } ModInt &operator*=(const ModInt &m) { return *this = *this * m; } ModInt &operator/=(const ModInt &m) { return *this = *this / m; } ModInt &operator^=(const u64 &y) { return *this = *this ^ y; } ModInt operator~ () const { return *this ^ (MODULO - 2); } ModInt operator- () const { return ModInt(set(MODULO - x)); } ModInt operator! () const { return getFact(u32(*this)); } ModInt operator& () const { return getFinv(u32(*this)); } ModInt operator++() { return *this = ModInt(set(x + 1)); } ModInt operator--() { return *this = ModInt(set(x + MODULO - 1)); } bool operator==(const ModInt &m) const { return x == m.x; } bool operator!=(const ModInt &m) const { return x != m.x; } bool operator< (const ModInt &m) const { return x < m.x; } bool operator<=(const ModInt &m) const { return x <= m.x; } bool operator> (const ModInt &m) const { return x > m.x; } bool operator>=(const ModInt &m) const { return x >= m.x; } explicit operator u64() const { return x; } ModInt operator^(i64 y) const { return pow(x, y); } static ModInt pow(i64 x, i64 y) { bool neg = false; if (y < 0) y = -y, neg = true; ModInt u(1), t(x); while (y) { if (y & 1) u *= t; t *= t; y >>= 1; } return neg ? ModInt(1) / u : u; } friend ostream &operator<<(ostream &os, const ModInt< MODULO > &m) { return os << m.x; } friend istream &operator>>(istream &is, ModInt< MODULO > &m) { u64 y; is >> y; m = ModInt(y); return is; } static vector< ModInt > fact, finv, invs; static void init(u32 n) { u32 m = fact.size(); if (n < m) return; fact.resize(n + 1, 1); finv.resize(n + 1, 1); invs.resize(n + 1, 1); if (m == 0) m = 1; for (u32 i = m; i <= n; ++i) fact[i] = fact[i - 1] * ModInt(i); finv[n] = ModInt(1) / fact[n]; for (u32 i = n; i >= m; --i) finv[i - 1] = finv[i] * ModInt(i); for (u32 i = m; i <= n; ++i) invs[i] = finv[i] * fact[i - 1]; } static ModInt getFact(u32 n) { init(n); return fact[n]; } static ModInt getFinv(u32 n) { init(n); return finv[n]; } static ModInt getInvs(u32 n) { init(n); return invs[n]; } static ModInt C(i64 n, i64 r) { if (r == 0) return ModInt(1); if (r < 0) return ModInt(0); if (n < 0) return ModInt(r & 1 ? MODULO - 1 : 1) * C(-n + r - 1, r); if (n == 0 || n < r) return ModInt(0); init(n); return fact[n] * finv[n - r] * finv[r]; } static ModInt P(i64 n, i64 r) { if (n < r || r < 0) return ModInt(0); init(n); return fact[n] * finv[n - r]; } static ModInt H(i64 n, i64 r) { if (n < 0 || r < 0) return ModInt(0); if (!n && !r) return ModInt(1); init(n + r - 1); return C(n + r - 1, r); } static ModInt montmort(u32 n) { ModInt res; init(n); for (u32 k = 2; k <= n; ++k) { if (k & 1) res -= finv[k]; else res += finv[k]; } return res *= fact[n]; } static ModInt LagrangePolynomial(vector<ModInt> &y, i64 t) { u32 n = y.size() - 1; if (t <= n) return y[t]; init(n + 1); ModInt res, num(1); for (int i = 0; i <= n; ++i) num *= ModInt(t - i); for (int i = 0; i <= n; ++i) { ModInt tmp = y[i] * num / (ModInt(t - i)) * finv[i] * finv[n - i]; if ((n - i) & 1) res -= tmp; else res += tmp; } return res; } }; template< int MODULO > vector<ModInt< MODULO >> ModInt< MODULO >::fact = vector<ModInt< MODULO >>(); template< int MODULO > vector<ModInt< MODULO >> ModInt< MODULO >::finv = vector<ModInt< MODULO >>(); template< int MODULO > vector<ModInt< MODULO >> ModInt< MODULO >::invs = vector<ModInt< MODULO >>(); constexpr int MODULO = (int)1e9 + 7; using modint = ModInt< MODULO >; #pragma endregion #pragma region datastructure segment tree /** * @brief セグメント木 * @docs docs/datastructure/segmenttree/segmenttree.md */ template<typename T> struct SegmentTree { using F = function<T(T, T)>; vector<T> seg; int sz; const F func; const T IDENT; SegmentTree() {} SegmentTree(int n, const F f, const T &ID) : func(f), IDENT(ID) { sz = 1; while (sz < n) sz <<= 1; seg.assign(2 * sz - 1, IDENT); } SegmentTree(vector<T> v, const F f, const T &ID) : func(f), IDENT(ID) { int n = v.size(); sz = 1; while (sz < n) sz <<= 1; seg.assign(2 * sz - 1, IDENT); for (int i = 0; i < n; ++i) seg[i + sz - 1] = v[i]; for (int i = sz - 2; i >= 0; --i) seg[i] = func(seg[2 * i + 1], seg[2 * i + 2]); } void update(int k, T x) { k += sz - 1; seg[k] = x; while (k > 0) { k = (k - 1) / 2; seg[k] = func(seg[2 * k + 1], seg[2 * k + 2]); } } void add(int k, T x) { k += sz - 1; seg[k] += x; while (k > 0) { k = (k - 1) / 2; seg[k] = func(seg[2 * k + 1], seg[2 * k + 2]); } } T query(int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0) r = sz; if (r <= a || l >= b) return IDENT; if (l >= a && r <= b) return seg[k]; T f_l = query(a, b, 2 * k + 1, l, (l + r) / 2); T f_r = query(a, b, 2 * k + 2, (l + r) / 2, r); return func(f_l, f_r); } void print() { for (int i = 0; i < 2 * sz - 1; ++i) { cerr << seg[i] << ' '; if (!((i + 2) & (i + 1))) cerr << endl; } } }; #pragma endregion const ll LIM = 1'000'000'000; signed main() { SS(int, N); SV(int, A, N); bool zero = false; REP(i, N) zero |= A[i] == 0; if (zero) return print(0); SegmentTree<ll> seg(N, [](ll a, ll b) -> ll { ll m = a * b; if (m >= LIM) return 0LL; return m; }, 1LL); REP(i, N) seg.update(i, A[i]); vector<ll> acc(N, 0); stack<pair<int, int>> st; REP(i, N) { using T = long long; // pi a_[i, mid) < 1e9 auto check = [&](T mid) -> bool { ll seki = seg.query(i, mid); return seki > 0; }; T ok = i, ng = N + 1; while (abs(ok - ng) > 1) { T mid = (ok + ng) / 2; (check(mid) ? ok : ng) = mid; } acc[i] += 1; if (ok < N) acc[ok] -= 1; if (i > 0) st.emplace(i - 1, ok - i); } REP(i, N - 1) acc[i + 1] += acc[i]; while (not st.empty()) { auto [p, q] = st.top(); st.pop(); acc[p] -= q; } for (int i = N - 1; i > 0; --i) { acc[i - 1] += acc[i]; } modint res = 1; REP(i, N) res *= modint::pow(A[i], acc[i]); print(res); }