結果

問題 No.1151 チャレンジゲーム
ユーザー uwiuwi
提出日時 2020-08-15 16:08:11
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,546 bytes
コンパイル時間 5,113 ms
コンパイル使用メモリ 85,076 KB
実行使用メモリ 50,532 KB
最終ジャッジ日時 2024-04-19 01:20:49
合計ジャッジ時間 40,427 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 121 ms
41,256 KB
testcase_01 AC 125 ms
41,680 KB
testcase_02 AC 208 ms
43,916 KB
testcase_03 AC 122 ms
41,276 KB
testcase_04 AC 127 ms
41,264 KB
testcase_05 AC 144 ms
41,288 KB
testcase_06 AC 130 ms
41,264 KB
testcase_07 AC 134 ms
41,524 KB
testcase_08 AC 139 ms
41,228 KB
testcase_09 AC 139 ms
41,808 KB
testcase_10 AC 147 ms
43,116 KB
testcase_11 AC 174 ms
43,848 KB
testcase_12 AC 201 ms
43,584 KB
testcase_13 AC 548 ms
48,340 KB
testcase_14 AC 512 ms
48,368 KB
testcase_15 AC 754 ms
48,408 KB
testcase_16 AC 418 ms
48,556 KB
testcase_17 AC 493 ms
48,604 KB
testcase_18 AC 525 ms
48,264 KB
testcase_19 AC 396 ms
48,444 KB
testcase_20 AC 482 ms
48,404 KB
testcase_21 AC 673 ms
48,400 KB
testcase_22 AC 490 ms
48,512 KB
testcase_23 AC 554 ms
48,356 KB
testcase_24 AC 448 ms
48,360 KB
testcase_25 AC 517 ms
48,420 KB
testcase_26 AC 552 ms
48,628 KB
testcase_27 AC 639 ms
48,416 KB
testcase_28 AC 564 ms
49,824 KB
testcase_29 AC 888 ms
50,472 KB
testcase_30 AC 921 ms
50,268 KB
testcase_31 AC 646 ms
50,132 KB
testcase_32 AC 955 ms
50,208 KB
testcase_33 AC 1,020 ms
50,380 KB
testcase_34 AC 803 ms
50,124 KB
testcase_35 AC 1,089 ms
50,188 KB
testcase_36 AC 1,281 ms
50,352 KB
testcase_37 AC 1,239 ms
50,420 KB
testcase_38 AC 690 ms
50,172 KB
testcase_39 AC 1,124 ms
50,148 KB
testcase_40 AC 734 ms
50,200 KB
testcase_41 AC 1,223 ms
50,152 KB
testcase_42 AC 1,163 ms
50,212 KB
testcase_43 AC 1,159 ms
50,236 KB
testcase_44 AC 704 ms
50,332 KB
testcase_45 AC 703 ms
50,280 KB
testcase_46 AC 980 ms
50,412 KB
testcase_47 AC 825 ms
50,116 KB
testcase_48 AC 236 ms
50,172 KB
testcase_49 TLE -
testcase_50 AC 477 ms
50,304 KB
testcase_51 AC 1,049 ms
50,344 KB
testcase_52 AC 625 ms
49,920 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 = 110;
		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;
				}
			}
			
			for(int j = 0;j <= 2*O;j++){
				double pl = 0, mi = 1;
				double[] h1 = new double[n];
				double[] h2 = new double[n];
				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-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