結果

問題 No.1230 Hall_and_me
ユーザー uwiuwi
提出日時 2020-09-18 21:42:33
言語 Java21
(openjdk 21)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 3,687 bytes
コンパイル時間 4,732 ms
コンパイル使用メモリ 85,904 KB
実行使用メモリ 58,108 KB
最終ジャッジ日時 2023-09-04 10:14:16
合計ジャッジ時間 10,721 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 119 ms
55,508 KB
testcase_01 AC 117 ms
55,752 KB
testcase_02 AC 118 ms
55,676 KB
testcase_03 AC 119 ms
55,576 KB
testcase_04 AC 117 ms
56,320 KB
testcase_05 AC 116 ms
55,908 KB
testcase_06 AC 116 ms
55,852 KB
testcase_07 AC 116 ms
55,796 KB
testcase_08 AC 115 ms
55,492 KB
testcase_09 AC 117 ms
55,908 KB
testcase_10 AC 113 ms
55,824 KB
testcase_11 AC 116 ms
55,572 KB
testcase_12 AC 116 ms
55,664 KB
testcase_13 AC 117 ms
55,304 KB
testcase_14 AC 116 ms
55,404 KB
testcase_15 AC 118 ms
55,680 KB
testcase_16 AC 119 ms
56,168 KB
testcase_17 AC 118 ms
55,328 KB
testcase_18 AC 117 ms
55,860 KB
testcase_19 AC 117 ms
55,660 KB
testcase_20 AC 117 ms
55,068 KB
testcase_21 AC 118 ms
55,948 KB
testcase_22 AC 117 ms
56,060 KB
testcase_23 AC 117 ms
55,528 KB
testcase_24 AC 119 ms
55,800 KB
testcase_25 AC 119 ms
58,108 KB
testcase_26 AC 120 ms
55,736 KB
testcase_27 AC 118 ms
55,652 KB
testcase_28 AC 117 ms
55,960 KB
testcase_29 AC 116 ms
55,808 KB
testcase_30 AC 119 ms
55,360 KB
testcase_31 AC 118 ms
55,264 KB
testcase_32 AC 119 ms
55,396 KB
testcase_33 AC 118 ms
55,584 KB
testcase_34 AC 120 ms
55,800 KB
testcase_35 AC 118 ms
55,540 KB
testcase_36 AC 118 ms
55,656 KB
testcase_37 AC 119 ms
55,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200918;
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 B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		double P = ni(), Q = ni(), R = ni();
		double[] a = {P/(P+Q+R), Q/(P+Q+R), R/(P+Q+R)};
		double ans = 0;
		for(int j = 0;j < 3;j++){ // select
			for(int c = 0;c < 2;c++) { // stay change
				double val = 0;
				for (int i = 0; i < 3; i++) { // answer
					double X = 0;
					for (int k = 0; k < 3; k++) { // open
						if(i == k)continue;
						if(j == k)continue;
						double p = i == j ? 0.5 : 1;
						int rem = 3-j-k;
						if(c == 1){
							if(i == rem){
								X += p;
							}
						}
						if(c == 0){
							if(i == j){
								X += p;
							}
						}
					}
					val += X * a[i];
				}
				ans = Math.max(ans, val);
			}
		}
		out.printf("%.14f\n", ans);
	}
	
	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 B().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