#303937 (Java21) No.766 金魚すくい

提出ソース

結果

問題	No.766 金魚すくい
ユーザー	uwi
提出日時	2018-12-14 19:49:51
言語	Java21 (openjdk 21)
結果	AC
実行時間	242 ms / 1,500 ms
コード長	5,029 bytes
コンパイル時間	4,647 ms
コンパイル使用メモリ	90,484 KB
実行使用メモリ	57,180 KB
最終ジャッジ日時	2024-09-25 05:14:10
合計ジャッジ時間	11,327 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	72 ms 50,968 KB
testcase_01	AC	72 ms 51,356 KB
testcase_02	AC	71 ms 51,276 KB
testcase_03	AC	72 ms 51,332 KB
testcase_04	AC	71 ms 51,084 KB
testcase_05	AC	72 ms 51,364 KB
testcase_06	AC	73 ms 51,108 KB
testcase_07	AC	71 ms 50,960 KB
testcase_08	AC	71 ms 51,024 KB
testcase_09	AC	70 ms 51,132 KB
testcase_10	AC	71 ms 51,060 KB
testcase_11	AC	71 ms 51,092 KB
testcase_12	AC	71 ms 51,180 KB
testcase_13	AC	73 ms 50,956 KB
testcase_14	AC	74 ms 51,252 KB
testcase_15	AC	72 ms 51,112 KB
testcase_16	AC	74 ms 51,216 KB
testcase_17	AC	74 ms 51,356 KB
testcase_18	AC	74 ms 51,164 KB
testcase_19	AC	75 ms 51,488 KB
testcase_20	AC	77 ms 51,368 KB
testcase_21	AC	85 ms 51,556 KB
testcase_22	AC	75 ms 51,340 KB
testcase_23	AC	242 ms 55,396 KB
testcase_24	AC	226 ms 55,508 KB
testcase_25	AC	235 ms 55,468 KB
testcase_26	AC	206 ms 55,268 KB
testcase_27	AC	231 ms 57,180 KB
testcase_28	AC	187 ms 55,288 KB
testcase_29	AC	222 ms 55,652 KB
testcase_30	AC	227 ms 55,836 KB
testcase_31	AC	231 ms 55,480 KB
testcase_32	AC	223 ms 55,196 KB
testcase_33	AC	226 ms 55,952 KB
testcase_34	AC	224 ms 55,212 KB
testcase_35	AC	71 ms 51,280 KB
testcase_36	AC	71 ms 51,264 KB
testcase_37	AC	228 ms 55,656 KB
testcase_38	AC	227 ms 55,800 KB
testcase_39	AC	222 ms 55,356 KB
testcase_40	AC	223 ms 55,308 KB
testcase_41	AC	142 ms 55,444 KB
testcase_42	AC	148 ms 55,592 KB
testcase_43	AC	71 ms 51,088 KB
testcase_44	AC	70 ms 51,248 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package adv2018;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Day14A {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	public static long C(int n, int r, int mod, int[][] fif) {
		if (n < 0 || r < 0 || r > n)
			return 0;
		return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
	}

	
	void solve()
	{
		int n = ni(), m = ni(), P = ni();
		int[] v = na(n);
		Arrays.sort(v);
		
		// iの手前まで取って全部割れる
		// p^m*(1-p)^(i)*C(i+m,m)
		long[] f = new long[n];
		int mod = 1000000007;
		int[][] fif = enumFIF(220000, mod);
		long p = P * invl(100, mod) % mod;
		long pm = pow(p, m, mod);
		
//		long all = 1;
		long po = pm;
		for(int i = 0;i < n;i++){
			f[i] = C(i+m-1, i, mod, fif) * po % mod;
			po = po * (mod+1-p)% mod;
//			all -= f[i];
		}
		for(int i = 0;i < n-1;i++) {
			f[i+1] += f[i];
			f[i+1] %= mod;
		}
		// C(i+m-1, i) * (1-p)^i * p^m
		// 1 * 0.5 * 0.5
		// 0.5 * 1 * (0.5)^0
//		f[n] = (all%mod+mod)%mod;
//		tr(f);
//		tr(v);
		long ans = 0;
		for(int i = 0;i < n;i++){
			ans += v[n-1-i] * (mod+1-f[i]);
			ans %= mod;
		}
		out.println(ans);
	}
	
	public static long pow(long a, long n, long mod) {
		//		a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = ret * ret % mod;
			if (n << 63 - 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 };
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new Day14A().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード