結果
問題 | No.1084 積の積 |
ユーザー |
![]() |
提出日時 | 2020-06-19 21:56:22 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 3,162 bytes |
コンパイル時間 | 1,992 ms |
コンパイル使用メモリ | 173,916 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-03 14:25:46 |
合計ジャッジ時間 | 3,057 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>#include <unistd.h>#include <sys/time.h>#include <stdlib.h>using namespace std;typedef long long ll;typedef pair<ll, ll> P;typedef pair<P, ll> T;typedef pair<long double , ll> Ps;typedef pair<ll, bool> Pb;const ll INF = 1e18;const ll fact_table = 3200008;long double Pi = 3.1415926535897932384626;priority_queue <ll> pql;priority_queue <P> pqp;priority_queue <P> bag;//big priority queuepriority_queue <ll, vector<ll>, greater<ll> > pqls;priority_queue <P, vector<P>, greater<P> > pqps;//small priority queue//top popll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};char dir[] = "DRUL";//↓,→,↑,←/*#define endl "\n"#ifdef ENJAPMA#undef endl#endif*/#define p(x) cout<<x<<endl;#define el cout<<endl;#define pe(x) cout<<x<<" ";#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;#define pu(x) cout<<(x);#define pb push_back#define lb lower_bound#define ub upper_bound#define CLEAR(a) a = decltype(a)();#define pc(x) cout << x << ",";#define rep(i, n) for (ll i = 0; i < (n); i ++)// const ll mod = 998244353ll;const ll mod = 1000000007ll;ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;}void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}void line() { p("--------------------"); return;}/*ll fact[fact_table + 5],rfact[fact_table + 5];void c3_init(){fact[0] = rfact[0] = 1;for(ll i=1; i<=fact_table; i++){fact[i] = (fact[i-1]*i) % mod;}rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);for(ll i=fact_table; i>=1; i--){rfact[i-1] = rfact[i] * i;rfact[i-1] %= mod;}return;}ll c3(ll n,ll r){return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}*/bool multicase = false;ll n, m, k, num, a, b, c, d, e, h, q, ans, sum;typedef vector<ll> vec;typedef vector<vector<ll>> mat;vector<ll> v, u;ll x[200005];void solve() {cin >> n;for(ll i=0;i<n;i++){cin >> x[i];if (x[i] == 0) {p(0);return;}}int right = 0;ll pro = x[0], sum = x[0];ll ans = 1ll;for(int left = 0; left < n; left ++){while(right < n && x[right + 1] * pro < (ll)1e9 && right + 1 < n){pro *= x[right + 1];sum *= pro;sum %= mod;right ++;}ans *= sum;ans %= mod;ll res = mypow(x[left], right - left + 1, mod);res = mypow(res, mod - 2, mod);sum = (sum * res) % mod;pro *= mypow(x[left], mod - 2, mod);pro %= mod;// if (left == right) right ++;}p(ans);return;}int main() {// init();ios::sync_with_stdio(false);cin.tie(nullptr);ll q, testcase = 1;if (multicase) {cin >> q;} else {q = 1;}while (q--) {// pu("Case ");pu("#");pu(testcase);pu(": ");solve();testcase++;}// solve();return 0;}