#496474 (C++17) No.995 タピオカオイシクナーレ

• 問題: No.995 タピオカオイシクナーレ
• ユーザー: imoni_kawaii
• 提出日時: 2020-06-13 15:28:27
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 67 ms / 2,000 ms
• コード長: 2,988 bytes
• コンパイル時間: 2,824 ms
• コンパイル使用メモリ: 207,344 KB
• 実行使用メモリ: 35,556 KB
• 最終ジャッジ日時: 2024-06-25 12:13:03
• 合計ジャッジ時間: 5,349 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	33 ms; 34,608 KB
testcase_01	AC	33 ms; 34,624 KB
testcase_02	AC	32 ms; 34,676 KB
testcase_03	AC	33 ms; 34,640 KB
testcase_04	AC	33 ms; 34,636 KB
testcase_05	AC	34 ms; 34,616 KB
testcase_06	AC	34 ms; 34,648 KB
testcase_07	AC	33 ms; 34,688 KB
testcase_08	AC	33 ms; 34,452 KB
testcase_09	AC	33 ms; 34,632 KB
testcase_10	AC	33 ms; 34,596 KB
testcase_11	AC	33 ms; 34,692 KB
testcase_12	AC	35 ms; 34,588 KB
testcase_13	AC	33 ms; 34,696 KB
testcase_14	AC	34 ms; 34,688 KB
testcase_15	AC	34 ms; 34,476 KB
testcase_16	AC	65 ms; 35,372 KB
testcase_17	AC	66 ms; 35,392 KB
testcase_18	AC	66 ms; 35,284 KB
testcase_19	AC	65 ms; 35,556 KB
testcase_20	AC	65 ms; 35,548 KB
testcase_21	AC	66 ms; 35,480 KB
testcase_22	AC	66 ms; 35,432 KB
testcase_23	AC	67 ms; 35,348 KB
testcase_24	AC	66 ms; 35,352 KB
testcase_25	AC	66 ms; 35,352 KB

ソースコード

#include <bits/stdc++.h>
#ifdef _DEBUG
#include "debug.hpp"
#else
#define debug(...)
#endif
#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using ll = long long; using ld = long double; using pll = pair<ll, ll>;
const int INF = 1<<30; const ll LINF = 1LL<<60; const ld PI = 3.1415926535897932;
template<class T, class U> inline bool chmax(T &a, const U &b) { if(a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if(a > b) { a = b; return true; } return false; }

constexpr int MAX_N = 2010101;
constexpr int MOD = 1e9+7;
//constexpr int MOD = 998244353;

struct mint {
long long x;
  mint(long long x = 0) noexcept : x((x%MOD + MOD) % MOD) {}

  // basis
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) noexcept { if((x += a.x) >= MOD) x -= MOD; return *this; }
  mint& operator-=(const mint a) noexcept { if((x += MOD-a.x) >= MOD) x -= MOD; return *this; }
  mint& operator*=(const mint a) noexcept { (x *= a.x) %= MOD; return *this; }
  mint operator+(const mint a) const noexcept { return mint(*this) += a; }
  mint operator-(const mint a) const noexcept { return mint(*this) -= a; }
  mint operator*(const mint a) const noexcept { return mint(*this) *= a; }
  mint mpow(long long t) const noexcept {
    if(!t) return 1;
    mint a = mpow(t>>1);
    a *= a;
    if(t&1) a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const noexcept { return mpow(MOD-2); }
  mint& operator/=(const mint a) noexcept { return *this *= a.inv(); }
  mint operator/(const mint a) const noexcept { return mint(*this) /= a; }

  // comparison
  bool operator==(const mint &a) const noexcept { return this->x == a.x; }
  bool operator!=(const mint &a) const noexcept { return this->x != a.x; }

  // I/O stream
  friend istream& operator>>(istream& is, mint& a) noexcept { return is >> a.x; }
  friend ostream& operator<<(ostream& os, const mint& a) noexcept { return os << a.x; }
};
// additional
mint mpow(const long long &a, ll n) noexcept { return mint(a).mpow(n); }
mint mpow(const mint &a, ll n) noexcept { return a.mpow(n); }

struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n+1), ifact(n+1) {
    assert(n < MOD);
    fact[0] = 1;
    for(int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for(int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if(k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
} com(MAX_N);


signed main() {
  cin.tie(0); ios::sync_with_stdio(false);
  ll N, M, K, p, q;
  cin >> N >> M >> K >> p >> q;
  vector<ll> b(N);
  rep(i, N) cin >> b[i];
  mint ans = 0;
  mint t = mpow(mint(1)-mint(2)*mint(p)/mint(q), K)/mint(2);
  rep(i, M) {
    ans += mint(b[i])*(t+mint(1)/mint(2));
  }
  REP(i, M, N) {
    ans += mint(b[i])*(mint(1)/mint(2)-t);
  }
  cout << ans << '\n';
  return 0;
}