結果

問題 No.1151 チャレンジゲーム
ユーザー uwiuwi
提出日時 2020-08-15 16:11:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,895 ms / 2,000 ms
コード長 4,595 bytes
コンパイル時間 3,954 ms
コンパイル使用メモリ 82,976 KB
実行使用メモリ 49,652 KB
最終ジャッジ日時 2024-04-19 01:23:22
合計ジャッジ時間 29,428 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 116 ms
41,652 KB
testcase_01 AC 123 ms
41,376 KB
testcase_02 AC 158 ms
41,308 KB
testcase_03 AC 108 ms
40,084 KB
testcase_04 AC 123 ms
41,056 KB
testcase_05 AC 123 ms
41,152 KB
testcase_06 AC 120 ms
41,056 KB
testcase_07 AC 121 ms
41,132 KB
testcase_08 AC 123 ms
41,540 KB
testcase_09 AC 117 ms
41,064 KB
testcase_10 AC 129 ms
41,328 KB
testcase_11 AC 140 ms
41,308 KB
testcase_12 AC 156 ms
42,804 KB
testcase_13 AC 413 ms
44,248 KB
testcase_14 AC 340 ms
43,660 KB
testcase_15 AC 469 ms
43,620 KB
testcase_16 AC 298 ms
43,896 KB
testcase_17 AC 376 ms
43,944 KB
testcase_18 AC 382 ms
43,724 KB
testcase_19 AC 324 ms
43,980 KB
testcase_20 AC 344 ms
43,628 KB
testcase_21 AC 452 ms
44,032 KB
testcase_22 AC 362 ms
43,864 KB
testcase_23 AC 378 ms
44,028 KB
testcase_24 AC 373 ms
44,384 KB
testcase_25 AC 322 ms
43,748 KB
testcase_26 AC 334 ms
43,760 KB
testcase_27 AC 384 ms
43,976 KB
testcase_28 AC 433 ms
44,988 KB
testcase_29 AC 547 ms
45,092 KB
testcase_30 AC 647 ms
45,140 KB
testcase_31 AC 514 ms
44,856 KB
testcase_32 AC 548 ms
44,920 KB
testcase_33 AC 721 ms
45,364 KB
testcase_34 AC 563 ms
44,928 KB
testcase_35 AC 778 ms
45,612 KB
testcase_36 AC 897 ms
45,344 KB
testcase_37 AC 723 ms
45,176 KB
testcase_38 AC 430 ms
44,248 KB
testcase_39 AC 777 ms
45,292 KB
testcase_40 AC 525 ms
45,008 KB
testcase_41 AC 999 ms
46,012 KB
testcase_42 AC 834 ms
45,524 KB
testcase_43 AC 803 ms
45,252 KB
testcase_44 AC 432 ms
44,764 KB
testcase_45 AC 570 ms
45,376 KB
testcase_46 AC 669 ms
45,020 KB
testcase_47 AC 474 ms
44,868 KB
testcase_48 AC 155 ms
41,764 KB
testcase_49 AC 1,895 ms
49,652 KB
testcase_50 AC 306 ms
44,476 KB
testcase_51 AC 633 ms
45,020 KB
testcase_52 AC 488 ms
45,132 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
		}
		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.);
					h2[k] = (j-a[k] >= 0 ? P[0][i^1<<k][j-a[k]] : 0.);
				}
				for(int rep = 0;;rep++){
					double npl = 0, nmi = 1;
					for(int k : b){
						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)); }
}
0