結果

問題 No.1084 積の積
ユーザー penguinshunya
提出日時 2020-06-19 22:24:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 3,599 bytes
コンパイル時間 3,137 ms
コンパイル使用メモリ 203,956 KB
最終ジャッジ日時 2025-01-11 06:55:51
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())
using namespace std;
using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
void yes() { cout << "Yes" << endl; exit(0); }
void no() { cout << "No" << endl; exit(0); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> void amax(T &x, T y) { x = max(x, y); }
template <typename T> void amin(T &x, T y) { x = min(x, y); }
template <typename T> T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
const int INF = 1001001001;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
template <int mod>
struct ModInt {
int x;
ModInt(): x(0) {}
ModInt(long long a) { x = a % mod; if (x < 0) x += mod; }
ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; }
ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; }
ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt inverse() {
int a = x, b = mod, u = 1, v = 0;
while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }
return ModInt(u);
}
#define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; }
op(+, +=) op(-, -=) op(*, *=) op(/, /=)
#undef op
friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }
};
using mint = ModInt<1000000007>;
void solve() {
int n;
cin >> n;
vi32 a(n);
cin >> a;
{
bool zero = false;
rep(i, n) if (a[i] == 0) zero = true;
if (zero) {
cout << 0 << endl;
return;
}
}
using P = pair<int, int>;
vector<vector<P>> event(n + 1);
{
i64 acc = 1;
for (int l = 0, r = 0; l < n; l++) {
while (r < n && acc * a[r] < 1000000000) {
acc *= a[r];
r += 1;
}
event[l].emplace_back(0, r - l);
event[r].emplace_back(1, -1);
acc /= a[l];
}
}
i64 acc = 0;
int cnt = 0;
vi64 cnts(n);
rep(i, n) {
for (auto e : event[i]) {
int kind, size;
tie(kind, size) = e;
if (kind == 0) {
cnt += 1;
acc += size;
}
}
cnts[i] = acc;
for (auto e : event[i]) {
int kind, size;
tie(kind, size) = e;
if (kind == 1) {
cnt -= 1;
}
}
acc -= cnt;
}
mint ans = 1;
rep(i, n) ans *= exp((mint) a[i], cnts[i]);
cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0