結果

問題 No.210 探し物はどこですか？
ユーザー eitahoeitaho
提出日時 2015-06-11 17:34:32
言語 C#(csc)
(csc 3.9.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,322 bytes
コンパイル時間 1,057 ms
コンパイル使用メモリ 117,684 KB
実行使用メモリ 38,748 KB
最終ジャッジ日時 2024-07-06 15:40:51
合計ジャッジ時間 87,428 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,816 ms
33,804 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 1,815 ms
33,804 KB
testcase_04 AC 1,816 ms
31,896 KB
testcase_05 AC 1,816 ms
33,932 KB
testcase_06 AC 1,816 ms
31,496 KB
testcase_07 AC 1,816 ms
31,756 KB
testcase_08 AC 1,816 ms
33,932 KB
testcase_09 AC 1,814 ms
33,936 KB
testcase_10 AC 1,816 ms
33,804 KB
testcase_11 AC 1,817 ms
31,632 KB
testcase_12 AC 1,816 ms
31,768 KB
testcase_13 AC 1,816 ms
29,712 KB
testcase_14 AC 1,816 ms
31,756 KB
testcase_15 AC 1,815 ms
31,884 KB
testcase_16 AC 1,816 ms
31,748 KB
testcase_17 AC 1,816 ms
33,804 KB
testcase_18 AC 1,816 ms
33,924 KB
testcase_19 AC 1,816 ms
33,672 KB
testcase_20 AC 1,817 ms
33,792 KB
testcase_21 AC 1,814 ms
33,676 KB
testcase_22 AC 1,816 ms
31,744 KB
testcase_23 AC 1,816 ms
35,904 KB
testcase_24 AC 1,817 ms
31,816 KB
testcase_25 AC 1,816 ms
36,560 KB
testcase_26 AC 1,816 ms
33,872 KB
testcase_27 AC 1,815 ms
35,912 KB
testcase_28 AC 1,816 ms
35,272 KB
testcase_29 AC 1,816 ms
35,148 KB
testcase_30 AC 1,816 ms
33,236 KB
testcase_31 AC 1,816 ms
33,104 KB
testcase_32 AC 1,816 ms
35,528 KB
testcase_33 AC 1,816 ms
32,492 KB
testcase_34 AC 1,816 ms
36,976 KB
testcase_35 AC 1,817 ms
36,840 KB
testcase_36 AC 1,817 ms
35,180 KB
testcase_37 AC 1,816 ms
34,792 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 1,815 ms
31,344 KB
testcase_44 AC 1,816 ms
33,804 KB
testcase_45 AC 1,816 ms
33,548 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.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

class Program
{
    static readonly int TimeLimit = 1800;

    public void Solve()
    {
        var sw = Stopwatch.StartNew();
        int N = Reader.Int();
        var P = Reader.IntArray(N).Select(x => x / 1000.0).ToArray();
        var Q = Reader.IntArray(N).Select(x => x / 100.0).ToArray();
        var heap = new Heap<Tuple<double, int>>(true); // prob, index
        for (int i = 0; i < N; i++)
            heap.Push(Tuple.Create(P[i] * Q[i], i));
        double ans = 0;

        for (int count = 1; sw.ElapsedMilliseconds < TimeLimit; count++)
        {
            var t = heap.Pop();
            double prob = t.Item1;
            int i = t.Item2;
            ans += count * prob;
            heap.Push(Tuple.Create(prob * (1 - Q[i]), i));
        }

        Console.WriteLine(ans);
    }

    class Heap<T>
    {
        private const int InitialSize = 1024;
        private readonly int sign;
        private readonly Comparer<T> comp = Comparer<T>.Default;
        private T[] A = new T[InitialSize];
        public int Count { get; private set; }
        public Heap(bool greater = false) { sign = greater ? 1 : -1; }
        public T Peek() { return A[0]; }
        public bool Empty() { return Count == 0; }
        public void Push(T val)
        {
            if (Count == A.Length)
            {
                T[] next = new T[A.Length * 2];
                Array.Copy(A, next, A.Length);
                A = next;
            }
            A[Count++] = val;
            int i = Count - 1;
            while (i > 0)
            {
                int parent = (i - 1) / 2;
                if (Math.Sign(comp.Compare(val, A[parent])) == sign)
                {
                    A[i] = A[parent];
                    i = parent;
                }
                else break;
            }
            A[i] = val;
        }
        public T Pop()
        {
            T res = A[0];
            T val = A[--Count];
            if (Count == 0) return res;
            int i = 0;
            while (i * 2 + 1 < Count)
            {
                int L = i * 2 + 1;
                int R = i * 2 + 2;
                if (R < Count && Math.Sign(comp.Compare(A[R], A[L])) == sign) L = R;
                if (Math.Sign(comp.Compare(A[L], val)) == sign) { A[i] = A[L]; i = L; }
                else break;
            }
            A[i] = val;
            return res;
        }
    }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    private static TextReader reader = Console.In;
    private static readonly char[] separator = { ' ' };
    private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    private static string[] A = new string[0];
    private static int i;
    private static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public static string Line() { return reader.ReadLine().Trim(); }
    private static string[] Split(string s) { return s.Split(separator, op); }
    private static string Next() { CheckNext(); return A[i++]; }
    private static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
0