結果

問題 No.856 増える演算
ユーザー SumitacchanSumitacchan
提出日時 2019-08-10 01:22:12
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 264 ms / 3,153 ms
コード長 7,719 bytes
コンパイル時間 2,489 ms
コンパイル使用メモリ 179,268 KB
実行使用メモリ 43,352 KB
最終ジャッジ日時 2023-09-26 22:20:58
合計ジャッジ時間 26,036 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 194 ms
42,524 KB
testcase_01 AC 191 ms
42,576 KB
testcase_02 AC 195 ms
42,508 KB
testcase_03 AC 193 ms
42,508 KB
testcase_04 AC 193 ms
42,524 KB
testcase_05 AC 199 ms
42,436 KB
testcase_06 AC 194 ms
42,544 KB
testcase_07 AC 193 ms
42,576 KB
testcase_08 AC 196 ms
42,520 KB
testcase_09 AC 195 ms
42,512 KB
testcase_10 AC 191 ms
42,640 KB
testcase_11 AC 196 ms
42,472 KB
testcase_12 AC 190 ms
42,568 KB
testcase_13 AC 190 ms
42,572 KB
testcase_14 AC 193 ms
42,532 KB
testcase_15 AC 189 ms
42,472 KB
testcase_16 AC 190 ms
42,436 KB
testcase_17 AC 195 ms
42,540 KB
testcase_18 AC 194 ms
42,536 KB
testcase_19 AC 193 ms
42,552 KB
testcase_20 AC 202 ms
42,556 KB
testcase_21 AC 194 ms
42,552 KB
testcase_22 AC 198 ms
42,456 KB
testcase_23 AC 204 ms
42,440 KB
testcase_24 AC 198 ms
42,564 KB
testcase_25 AC 194 ms
42,512 KB
testcase_26 AC 199 ms
42,532 KB
testcase_27 AC 196 ms
42,452 KB
testcase_28 AC 195 ms
42,568 KB
testcase_29 AC 200 ms
42,436 KB
testcase_30 AC 195 ms
42,576 KB
testcase_31 AC 188 ms
42,512 KB
testcase_32 AC 192 ms
42,508 KB
testcase_33 AC 196 ms
42,496 KB
testcase_34 AC 197 ms
42,788 KB
testcase_35 AC 201 ms
42,524 KB
testcase_36 AC 205 ms
42,784 KB
testcase_37 AC 199 ms
42,552 KB
testcase_38 AC 198 ms
42,464 KB
testcase_39 AC 201 ms
42,544 KB
testcase_40 AC 197 ms
42,516 KB
testcase_41 AC 201 ms
42,524 KB
testcase_42 AC 205 ms
42,636 KB
testcase_43 AC 196 ms
42,572 KB
testcase_44 AC 194 ms
42,500 KB
testcase_45 AC 196 ms
42,548 KB
testcase_46 AC 197 ms
42,532 KB
testcase_47 AC 201 ms
42,564 KB
testcase_48 AC 201 ms
42,544 KB
testcase_49 AC 196 ms
42,552 KB
testcase_50 AC 204 ms
42,528 KB
testcase_51 AC 205 ms
42,820 KB
testcase_52 AC 208 ms
42,740 KB
testcase_53 AC 233 ms
42,836 KB
testcase_54 AC 220 ms
42,460 KB
testcase_55 AC 236 ms
42,724 KB
testcase_56 AC 210 ms
42,500 KB
testcase_57 AC 237 ms
42,772 KB
testcase_58 AC 231 ms
42,764 KB
testcase_59 AC 241 ms
43,100 KB
testcase_60 AC 221 ms
42,768 KB
testcase_61 AC 248 ms
43,032 KB
testcase_62 AC 243 ms
42,852 KB
testcase_63 AC 200 ms
42,544 KB
testcase_64 AC 234 ms
42,980 KB
testcase_65 AC 206 ms
42,636 KB
testcase_66 AC 222 ms
42,764 KB
testcase_67 AC 231 ms
42,744 KB
testcase_68 AC 238 ms
43,076 KB
testcase_69 AC 243 ms
43,052 KB
testcase_70 AC 252 ms
43,076 KB
testcase_71 AC 242 ms
42,996 KB
testcase_72 AC 237 ms
42,836 KB
testcase_73 AC 256 ms
43,228 KB
testcase_74 AC 251 ms
43,140 KB
testcase_75 AC 257 ms
43,304 KB
testcase_76 AC 255 ms
43,352 KB
testcase_77 AC 248 ms
43,336 KB
testcase_78 AC 250 ms
43,304 KB
testcase_79 AC 261 ms
43,228 KB
testcase_80 AC 264 ms
43,268 KB
testcase_81 AC 260 ms
43,212 KB
testcase_82 AC 236 ms
43,300 KB
権限があれば一括ダウンロードができます

ソースコード

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
class FFT
{
    using comp = complex<double>;
private:
    vector<comp> f, f_tmp;

    void forward_exec(int l, int r, int t){
        if(t == n) return;
        int sz = (r - l) >> 1;
        REP(i, sz){
            f_tmp[l + i] = f[l + 2 * i];
            f_tmp[l + sz + i] = f[l + 2 * i + 1];
        }
        FOR(i, l, r) f[i] = f_tmp[i];
        forward_exec(l, l + sz, t + 1);
        forward_exec(l + sz, r, t + 1);

        REP(i, sz) f_tmp[l + i] = f[l + i] + f[l + sz + i] * pow_e[i << t];
        REP(i, sz) f_tmp[l + sz + i] = f[l + i] + f[l + sz + i] * pow_e[(sz + i) << t];
        FOR(i, l, r) f[i] = f_tmp[i];
    }

    void inverse_exec(int l, int r, int t){
        if(t == n) return;
        int sz = (r - l) / 2;
        REP(i, sz){
            f_tmp[l + i] = f[l + 2 * i];
            f_tmp[l + sz + i] = f[l + 2 * i + 1];
        }
        FOR(i, l, r) f[i] = f_tmp[i];
        inverse_exec(l, l + sz, t + 1);
        inverse_exec(l + sz, r, t + 1);

        REP(i, sz) f_tmp[l + i] = f[l + i] + f[l + sz + i] * pow_e[N - (i << t)];
        REP(i, sz) f_tmp[l + sz + i] = f[l + i] + f[l + sz + i] * pow_e[N - ((sz + i) << t)];
        FOR(i, l, r) f[i] = f_tmp[i];
    }

public:

    int N, n;
    vector<comp> pow_e;

    FFT(int N): N(N){

        n = 31 - __builtin_clz((signed)N);
        assert(N == (1 << n));

        pow_e.resize(N + 1); 
        pow_e[0] = pow_e[N] = comp(1.0, 0.0);
        double phi = 2.0 * M_PI / N;
        FOR(i, 1, N) pow_e[i] = exp(comp(0, phi * i));

        f.resize(N);
        f_tmp.resize(N);
    }

    void exec(vector<comp> &F, bool inverse = false){
        assert(F.size() == N);
        f.swap(F);
        if(!inverse) forward_exec(0, N, 0);
        else inverse_exec(0, N, 0);
        F.swap(f);
        if(inverse){
            REP(i, N) F[i] /= N;
        }
    }

    vector<comp> convolution(vector<comp> A, vector<comp> B){
        exec(A);
        exec(B);
        vector<comp> C(N);
        REP(i, N) C[i] = A[i] * B[i];
        exec(C, true);
        return C;
    }

    vector<int> int_convolution(vector<int> A, vector<int> B){
        vector<comp> a(N), b(N);
        REP(i, N){
            a[i] = comp(A[i], 0);
            b[i] = comp(B[i], 0);
        }
        vector<comp> c = convolution(a, b);
        vector<int> C(N);
        REP(i, N) C[i] = (int)(c[i].real() + 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(bit(18), 0);
    FFT fft(bit(18));
    REP(i, N) cnt[A[i]]++;
    cnt = fft.int_convolution(cnt, cnt);
    REP(i, N) cnt[2 * A[i]] -= 1.0;
    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