結果

問題 No.766 金魚すくい
ユーザー hiromi_ayase
提出日時 2018-12-25 08:42:31
言語 Java
(openjdk 23)
結果
AC  
実行時間 524 ms / 1,500 ms
コード長 4,558 bytes
コンパイル時間 2,416 ms
コンパイル使用メモリ 93,512 KB
実行使用メモリ 49,860 KB
最終ジャッジ日時 2024-10-01 13:14:23
合計ジャッジ時間 16,428 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {


  private static void solve() {
    int n = ni();
    int m = ni();
    long p = ni();
    int[] v = na(n);
    Arrays.sort(v);
    int mod = 1000000000 + 7;
    int[][] fif = enumFIF(300010, mod);

    p = p * invl(100, mod) % mod;
    long ip = mod + 1 - p;
    long[] sum = new long[n + 1];
    for (int i = 0; i < n; i++) {
      sum[i + 1] = (sum[i] + v[n - i - 1]) % mod;;
    }
    long ret = 0;
    
    for (int i = 0; i < m; i++) {
      long now = (long)fif[0][n - 1 + i] * fif[1][n - 1] % mod * fif[1][i] % mod;

      now *= pow(p, i, mod);
      now %= mod;
      now *= pow(ip, n, mod);
      now %= mod;
      now *= sum[n];
      now %= mod;
      ret += now;
      ret %= mod;
    }
    for (int i = 0; i < n; i++) {
      long now = (long)fif[0][i + m - 1] * fif[1][i] % mod * fif[1][m - 1] % mod;
      now *= pow(p, m, mod);
      now %= mod;
      now *= pow(ip, i, mod);
      now %= mod;
      now *= sum[i];
      now %= mod;
      ret += now;
      ret %= mod;
    }
    System.out.println(ret);
  }

  public static long pow(long a, long n, long mod) {
    long ret = 1;
    int x = 63 - Long.numberOfLeadingZeros(n);
    for (; x >= 0; x--) {
      ret = ret * ret % mod;
      if (n << ~x < 0)
        ret = ret * a % mod;
    }
    return ret;
  }

  public static long invl(long a, long mod) {
    long b = mod;
    long p = 1, q = 0;
    while (b > 0) {
      long c = a / b;
      long d;
      d = a;
      a = b;
      b = d % b;
      d = p;
      p = q;
      q = d - c * q;
    }
    return p < 0 ? p + mod : p;
  }

  public static int[][] enumFIF(int n, int mod) {
    int[] f = new int[n + 1];
    int[] invf = new int[n + 1];
    f[0] = 1;
    for (int i = 1; i <= n; i++) {
      f[i] = (int) ((long) f[i - 1] * i % mod);
    }
    long a = f[n];
    long b = mod;
    long p = 1, q = 0;
    while (b > 0) {
      long c = a / b;
      long d;
      d = a;
      a = b;
      b = d % b;
      d = p;
      p = q;
      q = d - c * q;
    }
    invf[n] = (int) (p < 0 ? p + mod : p);
    for (int i = n - 1; i >= 0; i--) {
      invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
    }
    return new int[][] {f, invf};
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0