結果

問題 No.766 金魚すくい
ユーザー paruki
提出日時 2018-12-17 18:25:38
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 92 ms / 1,500 ms
コード長 3,473 bytes
コンパイル時間 1,931 ms
コンパイル使用メモリ 177,608 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-25 07:36:02
合計ジャッジ時間 6,842 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
template<int MOD>
class ModInt {
public:
ModInt() :value(0) {}
ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { }
ModInt& operator+=(ModInt that) {
value = value + that.value;
if (value >= MOD)value -= MOD;
return *this;
}
ModInt& operator-=(ModInt that) {
value -= that.value;
if (value<0)value += MOD;
return *this;
}
ModInt& operator*=(ModInt that) {
value = (int)((long long)value * that.value % MOD);
return *this;
}
ModInt &operator/=(ModInt that) {
return *this *= that.inverse();
}
ModInt operator+(ModInt that) const {
return ModInt(*this) += that;
}
ModInt operator-(ModInt that) const {
return ModInt(*this) -= that;
}
ModInt operator*(ModInt that) const {
return ModInt(*this) *= that;
}
ModInt operator/(ModInt that) const {
return ModInt(*this) /= that;
}
ModInt pow(long long k) const {
ModInt n = *this, res = 1;
while (k) {
if (k & 1)res *= n;
n *= n;
k >>= 1;
}
return res;
}
ModInt inverse() const {
long long a = value, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
int toi() const { return value; }
private:
int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
os << x.toi();
return os;
}
namespace comb {
const int N = 200005;
mint fact[N];
mint rev[N];
void init() {
fact[0] = 1;
for (int i = 1; i < N; ++i)fact[i] = fact[i - 1] * i;
for (int i = 0; i < N; ++i)rev[i] = fact[i].inverse();
}
mint C(int n, int r) {
if (n < r)return 0;
return fact[n] * rev[r] * rev[n - r];
}
mint H(int n, int r) {
return C(n + r - 1, r);
}
mint P(int n, int r) {
assert(n >= r);
return fact[n] * rev[n - r];
}
mint catalan(int n) {
return fact[2 * n] * rev[n + 1] * rev[n];
}
}
int N, M, P;
void solve() {
comb::init();
cin >> N >> M >> P;
mint p = mint(P) / 100, q = mint(1) - p;
vi V(N);
vector<mint> S(N + 1);
rep(i, N)cin >> V[i];
sort(V.rbegin(), V.rend());
rep(i, N) S[i + 1] = S[i] + V[i];
mint ans = 0, pm = p.pow(M), qq = 1;
for (int i = 1; i < N; ++i) {
qq *= q;
ans += comb::C(M - 1 + i, i)*qq*pm*S[i];
}
mint qn = qq * q, pp = 1;
rep(i, M) {
ans += comb::C(N - 1 + i, i)*qn*pp*S[N];
pp *= p;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0