結果

問題 No.1173 Endangered Species
ユーザー uwiuwi
提出日時 2020-08-14 22:04:15
言語 Java21
(openjdk 21)
結果
AC  
実行時間 338 ms / 2,000 ms
コード長 3,651 bytes
コンパイル時間 4,301 ms
コンパイル使用メモリ 87,748 KB
実行使用メモリ 58,600 KB
最終ジャッジ日時 2024-10-10 15:19:16
合計ジャッジ時間 9,651 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 125 ms
53,592 KB
testcase_01 AC 126 ms
54,016 KB
testcase_02 AC 125 ms
54,212 KB
testcase_03 AC 123 ms
53,984 KB
testcase_04 AC 126 ms
54,464 KB
testcase_05 AC 125 ms
54,004 KB
testcase_06 AC 125 ms
54,136 KB
testcase_07 AC 125 ms
53,516 KB
testcase_08 AC 125 ms
53,796 KB
testcase_09 AC 126 ms
53,720 KB
testcase_10 AC 128 ms
54,012 KB
testcase_11 AC 127 ms
53,864 KB
testcase_12 AC 139 ms
54,940 KB
testcase_13 AC 141 ms
54,100 KB
testcase_14 AC 221 ms
57,472 KB
testcase_15 AC 218 ms
57,696 KB
testcase_16 AC 287 ms
58,508 KB
testcase_17 AC 303 ms
58,072 KB
testcase_18 AC 338 ms
58,228 KB
testcase_19 AC 335 ms
58,280 KB
testcase_20 AC 338 ms
58,600 KB
testcase_21 AC 338 ms
58,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200814;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		double[] ps = new double[n];
		double[] qs = new double[n];
		for(int i = 0;i < n;i++){
			ps[i] = nd();
		}
		for(int i = 0;i < n;i++){
			qs[i] = nd();
		}
		int[] a = na(n);
		double low = 0, high = 1;
		for(int rep = 0;rep < 50;rep++){
			double h = low + (high - low) / 2;
			double epsum = 0;
			for(int k = 0;k < n;k++){
				double e = (1-qs[k]) / (1-qs[k] * h);
				epsum += e * ps[k];
			}
			if(epsum < h){
				high = h;
			}else{
				low = h;
			}
		}
		
		double ans = 0;
		for(int k = 0;k < n;k++){
			double e = (1-qs[k]) / (1-qs[k] * high);
			ans += Math.log(e)*a[k];
		}
		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 F().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