結果
問題 | No.210 探し物はどこですか? |
ユーザー | uwi |
提出日時 | 2015-05-15 22:43:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 765 ms / 2,000 ms |
コード長 | 3,770 bytes |
コンパイル時間 | 4,190 ms |
コンパイル使用メモリ | 77,696 KB |
実行使用メモリ | 57,572 KB |
最終ジャッジ日時 | 2023-09-20 08:25:21 |
合計ジャッジ時間 | 36,065 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 396 ms
56,264 KB |
testcase_01 | AC | 573 ms
56,156 KB |
testcase_02 | AC | 633 ms
57,052 KB |
testcase_03 | AC | 690 ms
55,824 KB |
testcase_04 | AC | 665 ms
56,004 KB |
testcase_05 | AC | 657 ms
55,960 KB |
testcase_06 | AC | 681 ms
55,856 KB |
testcase_07 | AC | 656 ms
56,032 KB |
testcase_08 | AC | 635 ms
56,244 KB |
testcase_09 | AC | 588 ms
56,668 KB |
testcase_10 | AC | 644 ms
56,212 KB |
testcase_11 | AC | 661 ms
56,640 KB |
testcase_12 | AC | 663 ms
56,688 KB |
testcase_13 | AC | 699 ms
56,320 KB |
testcase_14 | AC | 619 ms
56,792 KB |
testcase_15 | AC | 722 ms
56,640 KB |
testcase_16 | AC | 673 ms
56,376 KB |
testcase_17 | AC | 745 ms
56,932 KB |
testcase_18 | AC | 572 ms
56,308 KB |
testcase_19 | AC | 564 ms
56,596 KB |
testcase_20 | AC | 572 ms
56,600 KB |
testcase_21 | AC | 570 ms
54,780 KB |
testcase_22 | AC | 573 ms
56,876 KB |
testcase_23 | AC | 633 ms
56,492 KB |
testcase_24 | AC | 746 ms
57,084 KB |
testcase_25 | AC | 699 ms
56,676 KB |
testcase_26 | AC | 765 ms
56,500 KB |
testcase_27 | AC | 644 ms
57,064 KB |
testcase_28 | AC | 688 ms
56,484 KB |
testcase_29 | AC | 686 ms
56,816 KB |
testcase_30 | AC | 679 ms
56,652 KB |
testcase_31 | AC | 681 ms
56,552 KB |
testcase_32 | AC | 682 ms
56,480 KB |
testcase_33 | AC | 711 ms
57,392 KB |
testcase_34 | AC | 708 ms
57,120 KB |
testcase_35 | AC | 711 ms
57,240 KB |
testcase_36 | AC | 706 ms
57,252 KB |
testcase_37 | AC | 701 ms
57,076 KB |
testcase_38 | AC | 733 ms
57,176 KB |
testcase_39 | AC | 735 ms
57,492 KB |
testcase_40 | AC | 738 ms
57,536 KB |
testcase_41 | AC | 735 ms
57,572 KB |
testcase_42 | AC | 725 ms
56,968 KB |
testcase_43 | AC | 167 ms
55,728 KB |
testcase_44 | AC | 261 ms
55,808 KB |
testcase_45 | AC | 652 ms
55,496 KB |
ソースコード
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 < 3000000;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)); } }