結果

問題 No.1084 積の積
ユーザー ningenMeningenMe
提出日時 2020-06-25 08:30:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 3,589 bytes
コンパイル時間 2,201 ms
コンパイル使用メモリ 204,484 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-03 20:41:19
合計ジャッジ時間 4,377 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 32 ms
5,504 KB
testcase_05 RE -
testcase_06 AC 37 ms
5,632 KB
testcase_07 RE -
testcase_08 AC 2 ms
5,376 KB
testcase_09 RE -
testcase_10 RE -
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 18 ms
5,376 KB
testcase_13 AC 35 ms
5,376 KB
testcase_14 AC 14 ms
5,376 KB
testcase_15 AC 13 ms
5,376 KB
testcase_16 AC 41 ms
5,504 KB
testcase_17 AC 18 ms
5,376 KB
testcase_18 AC 28 ms
5,376 KB
testcase_19 AC 38 ms
5,376 KB
testcase_20 AC 10 ms
5,376 KB
testcase_21 AC 15 ms
5,376 KB
testcase_22 AC 11 ms
5,376 KB
testcase_23 AC 21 ms
5,376 KB
testcase_24 AC 20 ms
5,376 KB
testcase_25 AC 34 ms
5,376 KB
testcase_26 AC 23 ms
5,504 KB
testcase_27 AC 23 ms
5,504 KB
testcase_28 AC 23 ms
5,504 KB
testcase_29 AC 23 ms
5,632 KB
testcase_30 AC 22 ms
5,504 KB
testcase_31 AC 23 ms
5,504 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

//Pow_Mod O(log(n))
long long PowMod(long long x, long long n, long long mod) {
    long long res = 1;
    for (; n > 0; n >>= 1, (x *= x) %= mod) if (n & 1) (res *= x) %= mod;
    return res;
}

//Inv_Mod O(log(mod))
long long InvMod(long long x, long long mod){
	return PowMod(x,mod-2,mod); 
}

int main() {
    int N; cin >> N;
    vector<ll> A(N+2,0);
    for(int i = 1; i <= N; ++i) cin >> A[i];
    int r=1;
    ll sum = 1, M = 1000'000'000;
    vector<ll> imos1(N+2,0),imos2(N+2,0);
    for(int l = 1; l <= N; ++l) {
        while(r <= N && sum*A[r] < M) {
            sum *= A[r];
            r++;
        }
        imos1[l-1]--;
        imos1[r-1]++;
        imos2[l-1]-=(r-l);
        sum /= A[l];
    }
    for(int i = N; 1 <= i; --i) {
        imos1[i] += imos1[i+1];
    }
    for(int i = N; 1 <= i; --i) {
        imos1[i] += imos2[i];
    }
    for(int i = N; 1 <= i; --i) {
        imos1[i] += imos1[i+1];
    }
    ll ans = 1;
    for(int i = N; 1 <= i; --i) {
        ans *= PowMod(A[i],imos1[i],MOD);
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}
0