結果

問題 No.1151 チャレンジゲーム
ユーザー uwiuwi
提出日時 2020-08-15 16:10:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,843 ms / 2,000 ms
コード長 4,595 bytes
コンパイル時間 3,862 ms
コンパイル使用メモリ 90,168 KB
実行使用メモリ 60,084 KB
最終ジャッジ日時 2024-10-10 18:05:18
合計ジャッジ時間 29,464 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 120 ms
54,108 KB
testcase_01 AC 116 ms
53,744 KB
testcase_02 AC 150 ms
55,032 KB
testcase_03 AC 115 ms
53,884 KB
testcase_04 AC 116 ms
53,896 KB
testcase_05 AC 120 ms
53,872 KB
testcase_06 AC 119 ms
53,996 KB
testcase_07 AC 120 ms
53,872 KB
testcase_08 AC 124 ms
53,952 KB
testcase_09 AC 122 ms
54,196 KB
testcase_10 AC 130 ms
54,520 KB
testcase_11 AC 139 ms
53,676 KB
testcase_12 AC 164 ms
55,988 KB
testcase_13 AC 380 ms
55,732 KB
testcase_14 AC 333 ms
55,836 KB
testcase_15 AC 478 ms
55,496 KB
testcase_16 AC 336 ms
55,964 KB
testcase_17 AC 352 ms
55,696 KB
testcase_18 AC 363 ms
55,880 KB
testcase_19 AC 304 ms
55,496 KB
testcase_20 AC 335 ms
55,440 KB
testcase_21 AC 438 ms
55,780 KB
testcase_22 AC 333 ms
55,892 KB
testcase_23 AC 397 ms
55,204 KB
testcase_24 AC 356 ms
56,096 KB
testcase_25 AC 339 ms
56,016 KB
testcase_26 AC 352 ms
55,624 KB
testcase_27 AC 360 ms
55,048 KB
testcase_28 AC 442 ms
57,704 KB
testcase_29 AC 528 ms
57,676 KB
testcase_30 AC 657 ms
57,892 KB
testcase_31 AC 528 ms
57,852 KB
testcase_32 AC 565 ms
57,912 KB
testcase_33 AC 685 ms
57,756 KB
testcase_34 AC 575 ms
58,100 KB
testcase_35 AC 828 ms
57,908 KB
testcase_36 AC 902 ms
57,868 KB
testcase_37 AC 792 ms
58,064 KB
testcase_38 AC 444 ms
58,140 KB
testcase_39 AC 742 ms
57,636 KB
testcase_40 AC 490 ms
57,424 KB
testcase_41 AC 968 ms
57,644 KB
testcase_42 AC 871 ms
57,676 KB
testcase_43 AC 820 ms
57,756 KB
testcase_44 AC 407 ms
57,596 KB
testcase_45 AC 532 ms
57,952 KB
testcase_46 AC 680 ms
57,560 KB
testcase_47 AC 511 ms
58,172 KB
testcase_48 AC 151 ms
55,408 KB
testcase_49 AC 1,843 ms
60,084 KB
testcase_50 AC 307 ms
58,108 KB
testcase_51 AC 651 ms
57,904 KB
testcase_52 AC 496 ms
57,816 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) < 4e-7;
					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