結果

問題 No.210 探し物はどこですか？
ユーザー EmKjpEmKjp
提出日時 2015-05-16 00:04:48
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 5,377 bytes
コンパイル時間 981 ms
コンパイル使用メモリ 118,084 KB
実行使用メモリ 28,892 KB
最終ジャッジ日時 2024-07-06 04:35:37
合計ジャッジ時間 4,346 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
26,288 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 48 ms
26,032 KB
testcase_04 AC 41 ms
26,204 KB
testcase_05 AC 39 ms
26,456 KB
testcase_06 AC 46 ms
24,120 KB
testcase_07 AC 41 ms
26,320 KB
testcase_08 AC 37 ms
26,208 KB
testcase_09 AC 37 ms
26,332 KB
testcase_10 AC 38 ms
28,116 KB
testcase_11 AC 38 ms
26,200 KB
testcase_12 AC 40 ms
28,112 KB
testcase_13 AC 47 ms
27,988 KB
testcase_14 AC 50 ms
28,364 KB
testcase_15 AC 48 ms
25,948 KB
testcase_16 AC 51 ms
26,192 KB
testcase_17 AC 51 ms
26,068 KB
testcase_18 AC 52 ms
26,332 KB
testcase_19 AC 49 ms
26,324 KB
testcase_20 AC 49 ms
26,456 KB
testcase_21 AC 48 ms
26,192 KB
testcase_22 AC 48 ms
28,368 KB
testcase_23 AC 61 ms
26,408 KB
testcase_24 AC 65 ms
24,496 KB
testcase_25 AC 61 ms
28,456 KB
testcase_26 AC 68 ms
26,804 KB
testcase_27 AC 65 ms
28,468 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 61 ms
28,624 KB
testcase_34 AC 62 ms
26,588 KB
testcase_35 AC 64 ms
28,508 KB
testcase_36 AC 62 ms
26,324 KB
testcase_37 AC 61 ms
26,288 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 29 ms
26,288 KB
testcase_44 AC 32 ms
26,460 KB
testcase_45 AC 45 ms
28,116 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;


public class PriorityQueue<T> {
    private T[] array = new T[100];
    private int size = 0;
    private Comparison<T> comp;

    public PriorityQueue() {
        this.comp = Comparer<T>.Default.Compare;
    }

    public PriorityQueue(Comparison<T> comp) {
        this.comp = comp;
    }

    private void Swap(int a, int b) {
        T t = array[a];
        array[a] = array[b];
        array[b] = t;
    }

    private void Expand() {
        var newlist = new T[array.Length * 2];
        Array.Copy(array, newlist, array.Length);
        array = newlist;
    }

    public bool Any() {
        return size > 0;
    }

    public void Enqueue(T newValue) {
        if (size >= array.Length) {
            Expand();
        }
        array[size++] = newValue;
        int pos = size - 1;
        while (pos > 0) {
            int parent = (pos - 1) / 2;
            if (comp(array[parent], array[pos]) > 0) {
                Swap(parent, pos);
                pos = parent;
            } else
                break;
        }
    }

    public T Dequeue() {
        T top = array[0];
        array[0] = array[--size];
        int pos = 0;
        while (pos * 2 + 1 < size) {
            int left = pos * 2 + 1;
            int right = left + 1;
            int next = left;
            if (right < size && comp(array[left], array[right]) > 0)
                next = right;

            if (comp(array[pos], array[next]) > 0) {
                Swap(next, pos);
                pos = next;
            } else
                break;
        }

        return top;
    }
};

public struct Node {
    public double Percentage { get; set; }
    public int Room { get; set; }
}

partial class Solver {
    public void Run() {
        var n = ni();
        var p = ni(n);
        var q = ni(n);

        // メガネがその部屋にある確率
        var percentage = p.Select(x => x / 1000.0).ToArray();
        // 見つかる確率
        var find = q.Select(x => x / 100.0).ToArray();

        var qu = new PriorityQueue<Node>((n1, n2) => -n1.Percentage.CompareTo(n2.Percentage));
        double ans = 0;

        for (int i = 0; i < n; i++) {
            qu.Enqueue(new Node { Percentage = percentage[i] * find[i], Room = i });
        }

        for (int i = 1; i < 100000; i++) {
            var node = qu.Dequeue();
            ans += i * node.Percentage;
            node.Percentage *= (1.0 - find[node.Room]);
            qu.Enqueue(node);
        }

        cout.WriteLine("{0:F10}", ans);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        /*new Solver("1 1000 50", Console.Out).Run();
        new Solver(@"10
100 100 100 100 100 100 100 100 100 100
100 100 100 100 100 100 100 100 100 100", Console.Out).Run();
        new Solver(@"10
64 201 4 30 232 64 197 7 102 99
28 43 94 52 24 33 97 55 36 89", Console.Out).Run();*/
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public string ns() { return Next(); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0