結果

問題 No.1084 積の積
ユーザー gazelle
提出日時 2020-06-19 22:00:00
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,519 bytes
コンパイル時間 1,077 ms
コンパイル使用メモリ 119,112 KB
最終ジャッジ日時 2025-01-11 06:16:37
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:162:11: error: ‘function’ does not name a type; did you mean ‘union’?
  162 |     const function<T(T, T)> op;
      |           ^~~~~~~~
      |           union
main.cpp:167:26: error: ‘function’ has not been declared
  167 |     segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
      |                          ^~~~~~~~
main.cpp:167:34: error: expected ‘,’ or ‘...’ before ‘<’ token
  167 |     segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
      |                                  ^
main.cpp: In constructor ‘segment_tree<T>::segment_tree(int, int)’:
main.cpp:167:62: error: class ‘segment_tree<T>’ does not have any field named ‘op’
  167 |     segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
      |                                                              ^~
main.cpp:167:65: error: ‘op’ was not declared in this scope
  167 |     segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
      |                                                                 ^~
main.cpp: In function ‘mi solve(std::vector<long long int>)’:
main.cpp:207:67: error: no matching function for call to ‘segment_tree<long long int>::segment_tree(int&, solve(std::vector<long long int>)::<lambda(ll, ll)>, int)’
  207 |     segment_tree<ll> rmulq(n, [] (ll a, ll b) { return a * b; }, 1);
      |                                                                   ^
main.cpp:167:5: note: candidate: ‘segment_tree<T>::segment_tree(int, int) [with T = long long int]’
  167 |     segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
      |     ^~~~~~~~~~~~
main.cpp:167:5: note:   candidate expects 2 arguments, 3 provided
main.cpp:159:30: note: candidate: ‘segment_tree<long long int>::segment_tree(const segment_tree<long long int>&)’
  159 | template <typename T> struct segment_tree {
      |                              ^~~~~~~

ソースコード

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

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <random>
#include <iomanip>
#include <bitset>
#include <array>
#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-6;
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
os << to_string(p.first) << " " << to_string(p.second);
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
REP(i, v.size()) {
if(i) os << " ";
os << v[i];
}
return os;
}
struct modint {
ll n;
public:
modint(const ll n = 0) : n((n % mod + mod) % mod) {}
static modint pow(modint a, int m) {
modint r = 1;
while(m > 0) {
if(m & 1) { r *= a; }
a = (a * a); m /= 2;
}
return r;
}
modint &operator++() { *this += 1; return *this; }
modint &operator--() { *this -= 1; return *this; }
modint operator++(int) { modint ret = *this; *this += 1; return ret; }
modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
friend bool operator==(const modint& lhs, const modint& rhs) {
return lhs.n == rhs.n;
}
friend bool operator<(const modint& lhs, const modint& rhs) {
return lhs.n < rhs.n;
}
friend bool operator>(const modint& lhs, const modint& rhs) {
return lhs.n > rhs.n;
}
friend modint &operator+=(modint& lhs, const modint& rhs) {
lhs.n += rhs.n;
if (lhs.n >= mod) lhs.n -= mod;
return lhs;
}
friend modint &operator-=(modint& lhs, const modint& rhs) {
lhs.n -= rhs.n;
if (lhs.n < 0) lhs.n += mod;
return lhs;
}
friend modint &operator*=(modint& lhs, const modint& rhs) {
lhs.n = (lhs.n * rhs.n) % mod;
return lhs;
}
friend modint &operator/=(modint& lhs, const modint& rhs) {
lhs.n = (lhs.n * (~rhs).n) % mod;
return lhs;
}
friend modint operator+(const modint& lhs, const modint& rhs) {
return modint(lhs.n + rhs.n);
}
friend modint operator-(const modint& lhs, const modint& rhs) {
return modint(lhs.n - rhs.n);
}
friend modint operator*(const modint& lhs, const modint& rhs) {
return modint(lhs.n * rhs.n);
}
friend modint operator/(const modint& lhs, const modint& rhs) {
return modint(lhs.n * (~rhs).n);
}
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
#define MAX_N 1010101
long long extgcd(long long a, long long b, long long& x, long long& y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1; y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
if(fact[0] == inf) {
fact[0]=1;
if(MAX_N != 0) fact[1]=1;
for(ll i = 2; i <= MAX_N; ++i) {
fact[i] = (fact[i-1] * i) % mod;
}
}
e = 0;
if(n == 0) return 1;
long long res = mod_fact(n / mod, e);
e += n / mod;
if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
if(n < 0 || k < 0 || n < k) return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
if(e1 > e2 + e3) return 0;
return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
using mi = modint;
mi mod_pow(mi a, ll n) {
mi ret = 1;
mi tmp = a;
while(n > 0) {
if(n % 2) ret *= tmp;
tmp = tmp * tmp;
n /= 2;
}
return ret;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <typename T> struct segment_tree {
private:
int n;
const function<T(T, T)> op;
const T ie;
vector<T> seq;
public:
segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
n = 1;
while(n < _n) n *= 2;
seq.resize(2 * n - 1);
for(int i = 0; i < 2 * n - 1; i++) seq[i] = ie;
}
void update(int k, const T e) {
k += n - 1;
seq[k] = e;
while(k > 0) {
k = (k - 1) / 2;
seq[k] = op(seq[k * 2 + 1], seq[k * 2 + 2]);
}
}
T get(int k) {
k += n - 1;
return seq[k];
}
T query(int a, int b, int k = 0, int l = 0, int r = -1) {
if(r == -1) r = n;
if(r <= a || b <= l) return ie;
if(a <= l && r <= b) return seq[k];
T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return op(vl, vr);
}
};
// segment_tree<ll> rsq(n, [] (ll a, ll b) { return a + b; }, 0)
// segment_tree<ll> rMq(n, [] (ll a, ll b) { return max(a, b); }, -1e18)
// segment_tree<ll> rmq(n, [] (ll a, ll b) { return min(a, b); }, 1e18)
using ld = long double;
mi solve(vector<ll> a) {
int n = a.size();
mi ret = 1;
segment_tree<ll> rmulq(n, [] (ll a, ll b) { return a * b; }, 1);
REP(i, n) rmulq.update(i, a[i]);
queue<int> last;
mi sum = 1;
for(int i = n - 1; i >= 0; i--) {
last.push(i);
sum *= mod_pow(a[i], (int)last.size());
while(rmulq.query(i, last.front() + 1) >= inf) {
sum *= mod_pow(rmulq.query(i, last.front() + 1), mod - 2);
last.pop();
}
ret *= sum;
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<ll> tmp;
mi ans = 1;
REP(i, n) {
if(a[i] == 0) {
cout << 0 << endl;
return 0;
} else tmp.pb(a[i]);
}
if(!tmp.empty()) ans *= solve(tmp);
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0