結果

問題 No.210 探し物はどこですか？
ユーザー uwiuwi
提出日時 2015-05-15 23:34:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 655 ms / 2,000 ms
コード長 3,770 bytes
コンパイル時間 3,753 ms
コンパイル使用メモリ 78,364 KB
実行使用メモリ 57,444 KB
最終ジャッジ日時 2023-09-20 08:38:56
合計ジャッジ時間 31,999 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 360 ms
56,216 KB
testcase_01 AC 503 ms
56,268 KB
testcase_02 AC 532 ms
56,756 KB
testcase_03 AC 607 ms
56,016 KB
testcase_04 AC 578 ms
56,224 KB
testcase_05 AC 578 ms
55,812 KB
testcase_06 AC 601 ms
55,936 KB
testcase_07 AC 578 ms
56,696 KB
testcase_08 AC 549 ms
56,096 KB
testcase_09 AC 510 ms
56,884 KB
testcase_10 AC 552 ms
56,016 KB
testcase_11 AC 597 ms
56,160 KB
testcase_12 AC 584 ms
56,256 KB
testcase_13 AC 601 ms
56,036 KB
testcase_14 AC 537 ms
56,676 KB
testcase_15 AC 635 ms
56,632 KB
testcase_16 AC 584 ms
56,284 KB
testcase_17 AC 655 ms
57,388 KB
testcase_18 AC 506 ms
56,284 KB
testcase_19 AC 502 ms
56,580 KB
testcase_20 AC 502 ms
56,424 KB
testcase_21 AC 503 ms
56,704 KB
testcase_22 AC 503 ms
56,744 KB
testcase_23 AC 563 ms
56,696 KB
testcase_24 AC 651 ms
56,728 KB
testcase_25 AC 605 ms
56,848 KB
testcase_26 AC 655 ms
56,760 KB
testcase_27 AC 571 ms
56,604 KB
testcase_28 AC 592 ms
56,612 KB
testcase_29 AC 601 ms
56,844 KB
testcase_30 AC 597 ms
56,540 KB
testcase_31 AC 599 ms
54,136 KB
testcase_32 AC 603 ms
56,356 KB
testcase_33 AC 623 ms
56,980 KB
testcase_34 AC 619 ms
57,444 KB
testcase_35 AC 645 ms
57,128 KB
testcase_36 AC 611 ms
57,012 KB
testcase_37 AC 621 ms
56,812 KB
testcase_38 AC 640 ms
57,156 KB
testcase_39 AC 645 ms
57,112 KB
testcase_40 AC 643 ms
56,996 KB
testcase_41 AC 648 ms
57,304 KB
testcase_42 AC 649 ms
57,108 KB
testcase_43 AC 160 ms
55,776 KB
testcase_44 AC 247 ms
55,980 KB
testcase_45 AC 576 ms
55,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

public class Q483 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		PriorityQueue<double[]> pq = new PriorityQueue<double[]>(2000, new Comparator<double[]>(){
			public int compare(double[] x, double[] y)
			{
				return -Double.compare(x[0], y[0]);
			}
		});
		double[] ps = new double[n];
		for(int i = 0;i < n;i++){
			ps[i] = nd()/1000;
		}
		double[] qs = new double[n];
		for(int i = 0;i < n;i++){
			qs[i] = nd()/100;
		}
		for(int i = 0;i < n;i++){
			pq.add(new double[]{ps[i]*qs[i], qs[i]});
		}
		
		double e = 0;
		for(int rep = 0;rep < 2500000;rep++){
			double[] cur = pq.poll();
			e += cur[0]*(rep+1);
			cur[0] *= 1.-cur[1];
			pq.add(cur);
		}
		out.printf("%.12f\n", e);
	}
	
	void run() throws Exception
	{
//		int n = 1000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(1 + " ");
//		}
//		for (int i = 0; i < n; i++) {
//			sb.append(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");
	}
	
	public static void main(String[] args) throws Exception { new Q483().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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