結果

問題 No.856 増える演算
ユーザー SumitacchanSumitacchan
提出日時 2019-07-26 23:16:07
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,237 bytes
コンパイル時間 2,197 ms
コンパイル使用メモリ 175,708 KB
実行使用メモリ 72,008 KB
最終ジャッジ日時 2023-09-15 04:35:11
合計ジャッジ時間 75,141 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 796 ms
71,128 KB
testcase_01 AC 811 ms
71,192 KB
testcase_02 AC 812 ms
71,196 KB
testcase_03 AC 810 ms
71,036 KB
testcase_04 AC 810 ms
71,176 KB
testcase_05 AC 811 ms
71,120 KB
testcase_06 AC 809 ms
71,084 KB
testcase_07 AC 812 ms
71,060 KB
testcase_08 AC 811 ms
71,180 KB
testcase_09 AC 806 ms
71,148 KB
testcase_10 AC 809 ms
71,048 KB
testcase_11 AC 805 ms
71,036 KB
testcase_12 AC 809 ms
71,048 KB
testcase_13 AC 812 ms
71,128 KB
testcase_14 AC 810 ms
71,184 KB
testcase_15 AC 795 ms
71,276 KB
testcase_16 AC 811 ms
71,044 KB
testcase_17 AC 813 ms
71,048 KB
testcase_18 AC 810 ms
71,160 KB
testcase_19 AC 814 ms
71,044 KB
testcase_20 AC 811 ms
71,180 KB
testcase_21 AC 794 ms
71,196 KB
testcase_22 AC 814 ms
71,032 KB
testcase_23 AC 812 ms
71,228 KB
testcase_24 AC 796 ms
71,196 KB
testcase_25 AC 811 ms
71,052 KB
testcase_26 AC 809 ms
71,192 KB
testcase_27 AC 808 ms
71,124 KB
testcase_28 AC 807 ms
71,136 KB
testcase_29 AC 806 ms
71,156 KB
testcase_30 AC 806 ms
71,232 KB
testcase_31 AC 811 ms
71,076 KB
testcase_32 AC 811 ms
71,176 KB
testcase_33 AC 811 ms
71,280 KB
testcase_34 AC 819 ms
71,440 KB
testcase_35 AC 804 ms
71,208 KB
testcase_36 AC 818 ms
71,268 KB
testcase_37 AC 820 ms
71,336 KB
testcase_38 AC 813 ms
71,204 KB
testcase_39 AC 815 ms
71,284 KB
testcase_40 AC 814 ms
71,192 KB
testcase_41 AC 814 ms
71,284 KB
testcase_42 AC 828 ms
71,304 KB
testcase_43 AC 818 ms
71,212 KB
testcase_44 AC 813 ms
71,060 KB
testcase_45 AC 810 ms
71,280 KB
testcase_46 AC 810 ms
71,212 KB
testcase_47 AC 811 ms
71,316 KB
testcase_48 AC 802 ms
71,320 KB
testcase_49 AC 812 ms
71,292 KB
testcase_50 AC 816 ms
71,204 KB
testcase_51 AC 820 ms
71,392 KB
testcase_52 AC 820 ms
71,392 KB
testcase_53 AC 847 ms
71,584 KB
testcase_54 AC 829 ms
71,224 KB
testcase_55 AC 845 ms
71,596 KB
testcase_56 AC 825 ms
71,288 KB
testcase_57 AC 851 ms
71,564 KB
testcase_58 AC 840 ms
71,368 KB
testcase_59 AC 847 ms
71,672 KB
testcase_60 AC 835 ms
71,424 KB
testcase_61 AC 863 ms
71,856 KB
testcase_62 AC 855 ms
71,724 KB
testcase_63 AC 811 ms
71,140 KB
testcase_64 AC 854 ms
71,564 KB
testcase_65 AC 824 ms
71,252 KB
testcase_66 AC 831 ms
71,356 KB
testcase_67 AC 846 ms
71,464 KB
testcase_68 AC 853 ms
71,668 KB
testcase_69 AC 852 ms
71,868 KB
testcase_70 AC 862 ms
71,856 KB
testcase_71 AC 865 ms
71,692 KB
testcase_72 AC 835 ms
71,544 KB
testcase_73 AC 869 ms
71,848 KB
testcase_74 AC 868 ms
71,844 KB
testcase_75 AC 870 ms
71,940 KB
testcase_76 AC 869 ms
71,908 KB
testcase_77 AC 868 ms
71,816 KB
testcase_78 AC 873 ms
71,964 KB
testcase_79 AC 875 ms
71,968 KB
testcase_80 AC 871 ms
72,004 KB
testcase_81 AC 871 ms
71,872 KB
testcase_82 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
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){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

template<long long MOD>
struct ModInt{

    using ll = long long;
    ll val;

    void setval(ll v) { val = v % MOD; };
    ModInt(): val(0) {}
    ModInt(ll v) { setval(v); };

    ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
    ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
    ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
    ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt operator+=(const ModInt &x) { return *this = *this + x; }
    ModInt operator-=(const ModInt &x) { return *this = *this - x; }
    ModInt operator*=(const ModInt &x) { return *this = *this * x; }
    ModInt operator/=(const ModInt &x) { return *this = *this / x; }

    friend ostream& operator<<(ostream &os, const ModInt &x) { os << x.val; return os; }
    friend istream& operator>>(istream &is, ModInt &x) { is >> x.val; x.val = (x.val % MOD + MOD) % MOD; return is; }

    ModInt pow(ll n) const {
        ModInt a = 1;
        if(n == 0) return a;
        int i0 = 64 - __builtin_clzll(n);
        for(int i = i0 - 1; i >= 0; i--){
            a = a * a;
            if((n >> i) & 1) a *= (*this); 
        }
        return a;
    }
    ModInt inv() const { return this->pow(MOD - 2); }
};

using mint = ModInt<mod>; mint pow(mint x, long long n) { return x.pow(n); }
//using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;

struct Combination{

    vector<mint> fact, invfact;

    Combination(int N){
        fact = vector<mint>({mint(1)});
        invfact = vector<mint>({mint(1)});
        fact_initialize(N);
    }

    void fact_initialize(int N){
        int i0 = fact.size();
        if(i0 >= N + 1) return;
        fact.resize(N + 1);
        invfact.resize(N + 1);
        for(int i = i0; i <= N; i++) fact[i] = fact[i - 1] * i;
        invfact[N] = (mint)1 / fact[N];
        for(int i = N - 1; i >= i0; i--) invfact[i] = invfact[i + 1] * (i + 1); 
    }

    mint nCr(int n, int r){
        if(n < 0 || r < 0 || r > n) return mint(0);
        if(fact.size() < n + 1) fact_initialize(n);
        return fact[n] * invfact[r] * invfact[n - r];
    }

    mint nPr(int n, int r){
        if(n < 0 || r < 0 || r > n) return mint(0);
        if(fact.size() < n + 1) fact_initialize(n);
        return fact[n] * invfact[n - r];
    }

};

//N=2^n, e^N=1
void FFT(vector<complex<long double>> &f, complex<long double> e){
    int N = f.size();
    if(N == 1) return;
    N /= 2;
    vector<complex<long double>> f0(N), f1(N);
    REP(i, N){
        f0[i] = f[2 * i];
        f1[i] = f[2 * i + 1];
    }
    complex<long double> e2 = e * e;
    FFT(f0, e2);
    FFT(f1, e2);

    complex<long double> c(1.0, 0.0);
    REP(i, N){
        f[i] = f0[i] + f1[i] * c;
        c *= e;
    }
    REP(i, N){
        f[i + N] = f0[i] + f1[i] * c;
        c *= e;
    }
}

vec conv(vec A, vec B){
    int n = bit(19);
    complex<long double> e(cos(2.0 * M_PI / n), sin(2.0 * M_PI / n));
    vector<complex<long double>> a(n, 0), b(n, 0);
    REP(i, SZ(A)){
        a[i] = complex<long double>(A[i], 0.0);
        b[i] = complex<long double>(B[i], 0.0);
    }
    FFT(a, e);
    FFT(b, e);
    REP(i, n) a[i] *= b[i];
    FFT(a, conj(e));
    vec C(n);
    REP(i, n) C[i] = (int)(a[i].real() / n + 0.5);
    return C;
}

signed main(){

    int N; cin >> N;
    vec A(N); cin >> A;
    
    long double vmin = INF;
    int m = A[0];
    mint mmin;
    FOR(i, 1, N){
        long double v = logl((long double)(m + A[i])) + (long double)A[i] * logl((long double)m);
        if(v < vmin){
            vmin = v;
            mmin = (mint)(m + A[i]) * pow((mint)m, A[i]);
        }
        Min(m, A[i]);
    }
    //debug(mmin);

    vec cnt(100001, 0);
    REP(i, N) cnt[A[i]]++;
    cnt = conv(cnt, cnt);
    REP(i, N) cnt[2 * A[i]]--;
    mint a1 = 1;
    REP(i, SZ(cnt)) a1 *= pow((mint)i, cnt[i] / 2);
    //debug(a1);

    mint a2 = 1;
    int s = 0;
    IREP(i, N){
        a2 *= pow((mint)A[i], s);
        s += A[i];
    }

    mint ans = a1 * a2 / mmin;
    Out(ans);

    return 0;
}
0