結果

問題 No.856 増える演算
ユーザー fumiphysfumiphys
提出日時 2019-08-10 16:38:28
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,091 bytes
コンパイル時間 2,012 ms
コンパイル使用メモリ 179,684 KB
実行使用メモリ 29,316 KB
最終ジャッジ日時 2023-09-26 23:26:51
合計ジャッジ時間 74,122 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 797 ms
28,208 KB
testcase_01 AC 793 ms
28,408 KB
testcase_02 AC 792 ms
28,204 KB
testcase_03 AC 794 ms
28,264 KB
testcase_04 AC 793 ms
28,344 KB
testcase_05 AC 796 ms
28,208 KB
testcase_06 AC 791 ms
28,208 KB
testcase_07 AC 794 ms
28,268 KB
testcase_08 AC 794 ms
28,204 KB
testcase_09 AC 793 ms
28,280 KB
testcase_10 AC 793 ms
28,220 KB
testcase_11 AC 795 ms
28,220 KB
testcase_12 AC 792 ms
28,472 KB
testcase_13 AC 793 ms
28,220 KB
testcase_14 AC 791 ms
28,360 KB
testcase_15 AC 795 ms
28,276 KB
testcase_16 AC 814 ms
28,212 KB
testcase_17 AC 793 ms
28,232 KB
testcase_18 AC 796 ms
28,272 KB
testcase_19 AC 790 ms
28,352 KB
testcase_20 AC 790 ms
28,428 KB
testcase_21 AC 790 ms
28,348 KB
testcase_22 AC 795 ms
28,348 KB
testcase_23 AC 796 ms
28,404 KB
testcase_24 AC 793 ms
28,292 KB
testcase_25 AC 794 ms
28,372 KB
testcase_26 AC 795 ms
28,360 KB
testcase_27 AC 799 ms
28,212 KB
testcase_28 AC 795 ms
28,396 KB
testcase_29 AC 795 ms
28,460 KB
testcase_30 AC 800 ms
28,248 KB
testcase_31 AC 796 ms
28,240 KB
testcase_32 AC 802 ms
28,504 KB
testcase_33 AC 796 ms
28,352 KB
testcase_34 AC 802 ms
28,516 KB
testcase_35 AC 796 ms
28,488 KB
testcase_36 AC 799 ms
28,524 KB
testcase_37 AC 810 ms
28,460 KB
testcase_38 AC 796 ms
28,296 KB
testcase_39 AC 797 ms
28,484 KB
testcase_40 AC 796 ms
28,292 KB
testcase_41 AC 794 ms
28,328 KB
testcase_42 AC 800 ms
28,520 KB
testcase_43 AC 797 ms
28,432 KB
testcase_44 AC 794 ms
28,348 KB
testcase_45 AC 792 ms
28,380 KB
testcase_46 AC 793 ms
28,492 KB
testcase_47 AC 800 ms
28,312 KB
testcase_48 AC 799 ms
28,508 KB
testcase_49 AC 798 ms
28,540 KB
testcase_50 AC 798 ms
28,508 KB
testcase_51 AC 803 ms
28,488 KB
testcase_52 AC 799 ms
28,648 KB
testcase_53 AC 828 ms
28,644 KB
testcase_54 AC 815 ms
28,448 KB
testcase_55 AC 833 ms
28,744 KB
testcase_56 AC 812 ms
28,484 KB
testcase_57 AC 826 ms
28,660 KB
testcase_58 AC 825 ms
28,720 KB
testcase_59 AC 835 ms
28,972 KB
testcase_60 AC 817 ms
28,472 KB
testcase_61 AC 840 ms
29,140 KB
testcase_62 AC 842 ms
28,772 KB
testcase_63 AC 800 ms
28,256 KB
testcase_64 AC 831 ms
28,776 KB
testcase_65 AC 811 ms
28,456 KB
testcase_66 AC 817 ms
28,568 KB
testcase_67 AC 825 ms
28,680 KB
testcase_68 AC 840 ms
28,840 KB
testcase_69 AC 845 ms
28,868 KB
testcase_70 AC 842 ms
29,052 KB
testcase_71 AC 832 ms
28,908 KB
testcase_72 AC 829 ms
28,728 KB
testcase_73 AC 846 ms
29,076 KB
testcase_74 AC 848 ms
29,316 KB
testcase_75 AC 850 ms
28,996 KB
testcase_76 AC 846 ms
29,316 KB
testcase_77 AC 847 ms
29,136 KB
testcase_78 AC 846 ms
29,020 KB
testcase_79 AC 853 ms
29,028 KB
testcase_80 AC 849 ms
29,052 KB
testcase_81 AC 848 ms
29,188 KB
testcase_82 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve

template <typename T>
T power(T a, T n, T mod) {
  n = n % (mod - 1);
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}


template<typename T>
T extgcd(T a, T b, T &x, T &y){ 
  T d = a;
  if(b != 0){
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  }else{
    x = 1, y = 0;
  }
  return d;
}

template <typename T>
T modinv(T a, T m){
  long long x = 0, y = 0;
  extgcd<long long>(a, m, x, y);
  x %= m;
  if(x < 0)x += m;
  return x;
}
template <int MOD, int g>
struct NTT{
  int get_mod(){
    return MOD;
  }
  void _ntt(vector<long long> &f, bool inv=false){
    int n = f.size(), mask = n - 1;
    int h = power<long long>(g, (MOD - 1) / n, MOD);
    if(inv)h = modinv(h, MOD);
    vector<long long> tmp(n);
    for(int i = n >> 1; i >= 1; i >>= 1){
      long long zeta = power<long long>(h, i, MOD);
      long long w = 1;
      for(int j = 0; j < n; j += i){
        for(int k = 0; k < i; k++){
          tmp[j+k] = (f[((j<<1)&mask)+k] + w * f[(((j<<1)+i)&mask)+k] % MOD) % MOD;
        }
        w = w * zeta % MOD;
      }
      swap(f, tmp);
    }
  }
  void ntt(vector<long long> &f){
    _ntt(f, false);
  }
  void intt(vector<long long> &f){
    _ntt(f, true);
    int n = f.size();
    int ni = modinv(n, MOD);
    for(int i = 0; i < n; i++)f[i] = f[i] * ni % MOD;
  }
  vector<long long> convolution(vector<long long> f, vector<long long> h){
    int n = 1;
    while(n < int(f.size() + h.size()))n *= 2;
    f.resize(n, 0); h.resize(n, 0);
    ntt(f);
    ntt(h);
    for(int i = 0; i < n; i++)f[i] = f[i] * h[i] % MOD;
    intt(f);
    return f;
  }
};

using NTT1 = NTT<167772161, 3>;
using NTT2 = NTT<469762049, 3>;
using NTT3 = NTT<1224736769, 3>;

template <typename T>
long long garner(vector<T> b, vector<T> m, T MOD){
  m.emplace_back(MOD);
  vector<long long> coef(m.size(), 1);
  vector<long long> consts(m.size(), 0);
  for(int i = 0; i < b.size(); i++){
    long long t = ((b[i] - consts[i]) % m[i]) * modinv<long long>(coef[i], m[i]) % m[i];
    for(int j = i + 1; j < m.size(); j++){
      consts[j] = (consts[j] + t * coef[j] % m[j]) % m[j];
      coef[j] = coef[j] * m[i] % m[j];
    }
  }
  return consts.back();
}


vector<long long> arbitrary_mod_convolution(vector<long long> f, vector<long long> g, int MOD){
  for(size_t i = 0; i < f.size(); i++)f[i] %= MOD;
  for(size_t i = 0; i < g.size(); i++)g[i] %= MOD;
  NTT1 ntt1;
  NTT2 ntt2;
  NTT3 ntt3;
  auto x1 = ntt1.convolution(f, g);
  auto x2 = ntt2.convolution(f, g);
  auto x3 = ntt3.convolution(f, g);

  vector<long long> res(x1.size());
  vector<long long> b(3), m(3);
  m[0] = ntt1.get_mod();
  m[1] = ntt2.get_mod();
  m[2] = ntt3.get_mod();
  for(size_t i = 0; i < x1.size(); i++){
    b[0] = x1[i];
    b[1] = x2[i];
    b[2] = x3[i];
    res[i] = garner<long long>(b, m, MOD);
  }
  return res;
}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); vector<ll> a(n); cin >> a;
  ll res = 1;
  ll sum = a[n-1];
  rrep(i, n - 1){
    res = res * power<ll>(a[i], sum, mod) % mod;
    sum += a[i];
  }

  vector<ll> b(2e5+1, 0);
  rep(i, n)b[a[i]]++;
  auto f = arbitrary_mod_convolution(b, b, mod);
  /*NTT1 ntt1;
    auto f = ntt1.convolution(b, b);*/
  rep(i, n)f[a[i] * 2]--;
  rep(i, sz(f))f[i] /= 2;
  /*rep(i, 10)cout << b[i] << "\n "[i + 1 != 10];
  rep(i, 10)cout << b[i] << "\n "[i + 1 != 10];
  rep(i, 10)cout << f[i] << "\n "[i + 1 != 10];*/
  FOR(i, 1, sz(f)){
    res = res * power<ll>(i, f[i], mod) % mod;
  }

  ll am = a[n-1];
  double mini = 1e18;
  ll prod = 1;
  rrep(i, n - 1){
    double tmp = log(a[i] + am) + am * log(a[i]);
    if(tmp < mini){
      mini = tmp;
      prod = (am + a[i]) * power<ll>(a[i], am, mod) % mod;
    }
    am = min(am, a[i]);
  }
  res = res * modinv<ll>(prod, mod) % mod;

  cout << res << endl;
  return 0;
}
0