結果
問題 | No.1151 チャレンジゲーム |
ユーザー | uwi |
提出日時 | 2020-08-15 16:14:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,610 ms / 2,000 ms |
コード長 | 4,794 bytes |
コンパイル時間 | 3,788 ms |
コンパイル使用メモリ | 90,060 KB |
実行使用メモリ | 49,260 KB |
最終ジャッジ日時 | 2024-04-19 01:24:12 |
合計ジャッジ時間 | 24,816 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 114 ms
40,556 KB |
testcase_01 | AC | 96 ms
39,860 KB |
testcase_02 | AC | 144 ms
41,376 KB |
testcase_03 | AC | 105 ms
40,680 KB |
testcase_04 | AC | 105 ms
40,996 KB |
testcase_05 | AC | 113 ms
40,888 KB |
testcase_06 | AC | 112 ms
40,896 KB |
testcase_07 | AC | 109 ms
41,088 KB |
testcase_08 | AC | 105 ms
40,744 KB |
testcase_09 | AC | 108 ms
41,176 KB |
testcase_10 | AC | 115 ms
40,832 KB |
testcase_11 | AC | 125 ms
41,116 KB |
testcase_12 | AC | 140 ms
42,364 KB |
testcase_13 | AC | 317 ms
43,544 KB |
testcase_14 | AC | 299 ms
43,832 KB |
testcase_15 | AC | 384 ms
43,936 KB |
testcase_16 | AC | 273 ms
43,592 KB |
testcase_17 | AC | 279 ms
43,584 KB |
testcase_18 | AC | 308 ms
44,092 KB |
testcase_19 | AC | 248 ms
43,404 KB |
testcase_20 | AC | 318 ms
43,528 KB |
testcase_21 | AC | 318 ms
43,548 KB |
testcase_22 | AC | 284 ms
44,500 KB |
testcase_23 | AC | 346 ms
44,072 KB |
testcase_24 | AC | 325 ms
44,060 KB |
testcase_25 | AC | 279 ms
43,744 KB |
testcase_26 | AC | 315 ms
43,484 KB |
testcase_27 | AC | 326 ms
43,756 KB |
testcase_28 | AC | 395 ms
44,808 KB |
testcase_29 | AC | 488 ms
44,936 KB |
testcase_30 | AC | 522 ms
44,888 KB |
testcase_31 | AC | 370 ms
44,864 KB |
testcase_32 | AC | 436 ms
44,712 KB |
testcase_33 | AC | 542 ms
44,720 KB |
testcase_34 | AC | 453 ms
44,996 KB |
testcase_35 | AC | 607 ms
45,192 KB |
testcase_36 | AC | 574 ms
45,020 KB |
testcase_37 | AC | 471 ms
44,716 KB |
testcase_38 | AC | 361 ms
45,096 KB |
testcase_39 | AC | 588 ms
44,928 KB |
testcase_40 | AC | 483 ms
45,412 KB |
testcase_41 | AC | 617 ms
45,804 KB |
testcase_42 | AC | 543 ms
44,804 KB |
testcase_43 | AC | 579 ms
45,248 KB |
testcase_44 | AC | 377 ms
44,484 KB |
testcase_45 | AC | 497 ms
45,012 KB |
testcase_46 | AC | 496 ms
44,820 KB |
testcase_47 | AC | 401 ms
44,552 KB |
testcase_48 | AC | 158 ms
42,692 KB |
testcase_49 | AC | 1,610 ms
49,260 KB |
testcase_50 | AC | 283 ms
44,136 KB |
testcase_51 | AC | 523 ms
45,432 KB |
testcase_52 | AC | 462 ms
45,144 KB |
ソースコード
package no1xxx; 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 No1151 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); int O = 0; for(int v : a){ O += v; } O = O / 2 + 2; double[][][] P = new double[2][1<<n][2*O+1]; for(int j = O+1;j <= 2*O;j++){ P[0][0][j] = 1; P[1][0][j] = 1; } double[] r = new double[n]; for(int k = 0;k < n;k++){ r[k] = 1 - 1./a[k]; } for(int i = 1;i < 1<<n;i++){ int[] b = new int[Integer.bitCount(i)]; int p = 0; for(int j = 0;j < n;j++){ if(i<<~j<0){ b[p++] = j; } } double[] h1 = new double[n]; double[] h2 = new double[n]; for(int j = 0;j <= 2*O;j++){ double pl = 0, mi = 1; for(int k : b){ h1[k] = ((j+a[k] <= 2*O ? P[1][i^1<<k][j+a[k]] : 1.)) / a[k]; h2[k] = ((j-a[k] >= 0 ? P[0][i^1<<k][j-a[k]] : 0.)) / a[k]; } for(int rep = 0;;rep++){ double npl = 0, nmi = 1; for(int k : b){ npl = Math.max(npl, h1[k] + mi * r[k]); nmi = Math.min(nmi, h2[k] + pl * r[k]); // npl = Math.max(npl, (h1[k] - mi) / a[k] + mi); // nmi = Math.min(nmi, (h2[k] - pl) / a[k] + pl); // if(i + 1 == 1<<n && rep == 10)tr(j, k, (j+a[k] <= 2*O ? P[1][i^1<<k][j+a[k]] : 1.) / a[k] + mi * (1-1./a[k])); // if(i + 1 == 1<<n && rep < 2)tr(j, k, (j-a[k] >= 0 ? P[0][i^1<<k][j-a[k]] : 0.) / a[k] + pl * (1-1./a[k])); } boolean end = Math.abs(pl - npl) + Math.abs(mi - nmi) < 1e-6; pl = npl; mi = nmi; if(end){ // tr(i, j, rep); break; } } P[0][i][j] = pl; P[1][i][j] = mi; } } out.printf("%.14f\n", P[0][(1<<n)-1][O]); } void run() throws Exception { // int n = 10, m = 99999; // Random gen = new Random(); // StringBuilder sb = new StringBuilder(); // sb.append(n + " "); // for (int i = 0; i < n; i++) { // sb.append(gen.nextInt(20)+1 + " "); // } // INPUT = sb.toString(); 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 No1151().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)); } }