結果
問題 | No.766 金魚すくい |
ユーザー |
👑 |
提出日時 | 2019-04-04 20:13:24 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 54 ms / 1,500 ms |
コード長 | 2,968 bytes |
コンパイル時間 | 1,185 ms |
コンパイル使用メモリ | 127,880 KB |
実行使用メモリ | 22,972 KB |
最終ジャッジ日時 | 2024-06-13 04:48:52 |
合計ジャッジ時間 | 4,238 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
import std.conv, std.functional, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }enum MO = 10L^^9 + 7;enum LIM = 3 * 10^^5;long[] inv, fac, invFac;void prepare() {inv = new long[LIM];fac = new long[LIM];invFac = new long[LIM];inv[1] = 1;foreach (i; 2 .. LIM) {inv[i] = MO - ((MO / i) * inv[cast(size_t)(MO % i)]) % MO;}fac[0] = invFac[0] = 1;foreach (i; 1 .. LIM) {fac[i] = (fac[i - 1] * i) % MO;invFac[i] = (invFac[i - 1] * inv[i]) % MO;}}long binom(long n, long k) {if (0 <= k && k <= n) {assert(n < LIM);return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] % MO * invFac[cast(size_t)(n - k)] % MO;} else {return 0;}}int N, M;long P;long[] V;void main() {prepare();try {for (; ; ) {N = readInt();M = readInt();P = readLong();V = new long[N];foreach (i; 0 .. N) {V[i] = readLong();}V.sort;V.reverse;auto PP = new long[LIM];auto QQ = new long[LIM];PP[0] = QQ[0] = 1;PP[1] = (P * inv[100]) % MO;QQ[1] = 1 - PP[1];foreach (j; 2 .. LIM) {PP[j] = (PP[j - 1] * PP[1]) % MO;QQ[j] = (QQ[j - 1] * QQ[1]) % MO;}// (M, 0), (M, 1), ... or (0, N), (1, N), ...auto prob = new long[N + 1];prob[0] = PP[M];foreach (i; 1 .. N) {prob[i] = ((binom(M + i, M) - binom(M + i - 1, M)) * ((PP[M] * QQ[i]) % MO)) % MO;}prob[N] = 1;foreach (i; 0 .. N) {prob[N] -= prob[i];prob[N] %= MO;}auto VSum = new long[N + 1];foreach (i; 0 .. N) {VSum[i + 1] = (VSum[i] + V[i]) % MO;}long ans;foreach (i; 0 .. N + 1) {ans += prob[i] * VSum[i];ans %= MO;}ans = (ans % MO + MO) % MO;writeln(ans);}} catch (EOFException e) {}}