結果

問題 No.766 金魚すくい
ユーザー Grenache
提出日時 2019-05-07 18:08:39
言語 Java
(openjdk 23)
結果
AC  
実行時間 387 ms / 1,500 ms
コード長 10,760 bytes
コンパイル時間 4,316 ms
コンパイル使用メモリ 82,116 KB
実行使用メモリ 50,300 KB
最終ジャッジ日時 2024-07-01 23:35:11
合計ジャッジ時間 14,984 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
public class Main_yukicoder766 {
private static Scanner sc;
private static Printer pr;
private static void solve() {
final int MOD = 1_000_000_007;
int n = sc.nextInt();
int m = sc.nextInt();
int p = sc.nextInt();
Integer[] v = new Integer[n];
for (int i = 0; i < n; i++) {
v[i] = sc.nextInt();
}
Arrays.sort(v, Collections.reverseOrder());
long[] cumsum = new long[n + 1];
for (int i = 0; i < n; i++) {
cumsum[i + 1] = (cumsum[i] + v[i]) % MOD;
}
int nm = Math.max(n, m);
PC pc = new PC(n + m, MOD);
long[] pp100 = new long[nm + 1];
long[] pp = new long[nm + 1];
long[] inv100 = new long[nm + 1];
pp100[0] = pp[0] = 1;
inv100[nm] = pc.pow((int)pc.pow(100, nm), MOD - 2);
for (int i = 1; i <= nm; i++) {
pp100[i] = pp100[i - 1] * (100 - p) % MOD;
pp[i] = pp[i - 1] * p % MOD;
inv100[nm - i] = inv100[nm - i + 1] * 100 % MOD;
}
// pr.println(inv100[0]);
// pr.println(inv100[1]);
long ans = 0;
for (int i = 0; i < m; i++) {
long tmp = pp[i] * inv100[i] % MOD;
tmp *= pc.C(n - 1 + i, i);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
ans *= cumsum[n];
ans %= MOD;
ans *= pp100[n];
ans %= MOD;
ans *= inv100[n];
ans %= MOD;
long ans2 = 0;
for (int i = 0; i < n; i++) {
long tmp = pp100[i] * inv100[i] % MOD;
tmp *= pc.C(m - 1 + i, i);
tmp %= MOD;
tmp *= cumsum[i];
tmp %= MOD;
ans2 += tmp;
ans2 %= MOD;
}
ans2 *= pp[m];
ans2 %= MOD;
ans2 *= inv100[m];
ans2 %= MOD;
pr.println((ans + ans2) % MOD);
}
/**
*
* MOD
*/
static class PC {
/** () */
int MOD;
/** {@code fact[i]=i! % MOD} */
long[] fact;
/** {@code ifact[i]=1/i! % MOD} */
long[] ifact;
/**
* size MOD
* O(size)
*
* @param size
* @param MOD
*/
PC(int size, int MOD) {
this.MOD = MOD;
fact = new long[size + 1];
fact[0] = 1;
for (int i = 1; i <= size; i++) {
fact[i] = fact[i - 1] * i % MOD;
}
ifact = new long[size + 1];
int loop = MOD - 2;
long x = fact[size];
ifact[size] = 1;
while (loop > 0) {
if (loop % 2 == 1) {
ifact[size] = ifact[size] * x % MOD;
}
x = x * x % MOD;
loop /= 2;
}
for (int i = size - 1; i >= 0; i--) {
ifact[i] = ifact[i + 1] * (i + 1) % MOD;
}
}
/**
* nCr
* O(1)
*
* @param n {@literal 0<=n<=size}
* @param r {@literal r>=0}
* @return nCr (MOD )
*/
int C(int n, int r) {
if (r > n) {
return 0;
}
return (int)(((fact[n] * ifact[n - r]) % MOD) * ifact[r] % MOD);
}
//
/**
* nPr
* O(1)
*
* @param n {@literal 0<=n<=size}
* @param r {@literal r>=0}
* @return nPr (MOD )
*/
int P(int n, int r) {
if (r > n) {
return 0;
}
return (int)((fact[n] * ifact[n -r]) % MOD);
}
/**
* nHr
* nr
* 0
* O(1)
*
* @param n {@literal 0<=n+r-1<=size}()
* @param r {@literal r>=0}
* @return nHr (MOD )
*/
int H(int n, int r) {
if (n == 0 && r == 0) {
return 1;
}
return C(n + r - 1, r);
}
/**
* nCr (n)
* O(r)
*
* @param n {@literal n>=0}(long)
* @param r {@literal 0<=r<=size}
* @return nCr (MOD )
*/
int C2(long n, int r) {
long ret = ifact[r];
for (int i = 1; i <= r; i++) {
long tmp = (n - r + i) % MOD;
ret = (ret * tmp) % MOD;
}
return (int)ret;
}
/**
* 2 S(n,r)
* nr()
* r!S(n,r)
* O(r log n)
*
* @param n {@literal n>=0}(long)
* @param r {@literal 0<=r<=size}
* @return S(n,r) (MOD )
*/
int S(long n, int r) {
//使1/r!
long ret = 0;
for (int i = 1; i <= r; i++) {
long tmp = (r - i) % 2 == 0 ? 1 : -1;
tmp *= pow(i, n) * C(r, i) % MOD;
ret = (ret + tmp + MOD) % MOD;
}
ret = ret * ifact[r] % MOD;
return (int)ret;
}
/**
* {@code a^n % MOD}
* O(log n)
*
* @param a
* @param n
* @return a^n (MOD )
*/
long pow(int a, long n) {
long loop = n;
long ret = 1;
long x = a;
while (loop > 0) {
if (loop % 2 == 1) {
ret = ret * x % MOD;
}
x = x * x % MOD;
loop /= 2;
}
return ret;
}
private final static int LIMIT = 66;
private static int to;
private static long[][] cache;
/**
* nCr (MOD)
*
* n=66 : 66C33=7_219_428_434_016_265_740
* O(n^2)
*
* @param n {@literal 0<=n<=66}
* @param r {@literal 0<=r}
* @return nCr
* @throws IllegalArgumentException {@literal n>66}
*/
static long CLong(int n, int r) {
if (r > n) {
return 0;
}
if (n > LIMIT) {
throw new IllegalArgumentException(Integer.toString(n));
}
if (cache == null) {
cache = new long[LIMIT + 1][];
cache[0] = new long[1];
cache[0][0] = 1;
to = 0;
}
if (cache[n] == null) {
for (int i = to + 1; i <= n; i++) {
cache[i] = new long[i + 1];
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
cache[i][j] = 1;
} else {
if (Long.MAX_VALUE - cache[i - 1][j - 1] < cache[i - 1][j]) {
throw new IllegalArgumentException("Overflow");
} else {
cache[i][j] = cache[i - 1][j - 1] + cache[i - 1][j];
}
}
}
}
to = n;
}
return cache[n][r];
}
}
// ---------------------------------------------------
public static void main(String[] args) {
sc = new Scanner(System.in);
pr = new Printer(System.out);
solve();
pr.close();
sc.close();
}
static class Scanner {
BufferedReader br;
Scanner (InputStream in) {
br = new BufferedReader(new InputStreamReader(in));
}
private boolean isPrintable(int ch) {
return ch >= '!' && ch <= '~';
}
private boolean isCRLF(int ch) {
return ch == '\n' || ch == '\r' || ch == -1;
}
private int nextPrintable() {
try {
int ch;
while (!isPrintable(ch = br.read())) {
if (ch == -1) {
throw new NoSuchElementException();
}
}
return ch;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
String next() {
try {
int ch = nextPrintable();
StringBuilder sb = new StringBuilder();
do {
sb.appendCodePoint(ch);
} while (isPrintable(ch = br.read()));
return sb.toString();
} catch (IOException e) {
throw new NoSuchElementException();
}
}
int nextInt() {
try {
// parseInt from Integer.parseInt()
boolean negative = false;
int res = 0;
int limit = -Integer.MAX_VALUE;
int radix = 10;
int fc = nextPrintable();
if (fc < '0') {
if (fc == '-') {
negative = true;
limit = Integer.MIN_VALUE;
} else if (fc != '+') {
throw new NumberFormatException();
}
fc = br.read();
}
int multmin = limit / radix;
int ch = fc;
do {
int digit = ch - '0';
if (digit < 0 || digit >= radix) {
throw new NumberFormatException();
}
if (res < multmin) {
throw new NumberFormatException();
}
res *= radix;
if (res < limit + digit) {
throw new NumberFormatException();
}
res -= digit;
} while (isPrintable(ch = br.read()));
return negative ? res : -res;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
long nextLong() {
try {
// parseLong from Long.parseLong()
boolean negative = false;
long res = 0;
long limit = -Long.MAX_VALUE;
int radix = 10;
int fc = nextPrintable();
if (fc < '0') {
if (fc == '-') {
negative = true;
limit = Long.MIN_VALUE;
} else if (fc != '+') {
throw new NumberFormatException();
}
fc = br.read();
}
long multmin = limit / radix;
int ch = fc;
do {
int digit = ch - '0';
if (digit < 0 || digit >= radix) {
throw new NumberFormatException();
}
if (res < multmin) {
throw new NumberFormatException();
}
res *= radix;
if (res < limit + digit) {
throw new NumberFormatException();
}
res -= digit;
} while (isPrintable(ch = br.read()));
return negative ? res : -res;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
float nextFloat() {
return Float.parseFloat(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
try {
int ch;
while (isCRLF(ch = br.read())) {
if (ch == -1) {
throw new NoSuchElementException();
}
}
StringBuilder sb = new StringBuilder();
do {
sb.appendCodePoint(ch);
} while (!isCRLF(ch = br.read()));
return sb.toString();
} catch (IOException e) {
throw new NoSuchElementException();
}
}
void close() {
try {
br.close();
} catch (IOException e) {
// throw new NoSuchElementException();
}
}
}
static class Printer extends PrintWriter {
Printer(OutputStream out) {
super(out);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0