結果
| 問題 | No.210 探し物はどこですか？ |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-22 14:15:16 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,769 bytes |
| コンパイル時間 | 1,754 ms |
| コンパイル使用メモリ | 112,384 KB |
| 実行使用メモリ | 93,940 KB |
| 最終ジャッジ日時 | 2024-07-06 04:32:29 |
| 合計ジャッジ時間 | 70,377 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,104 ms
46,264 KB |
| testcase_01 | AC | 1,107 ms
50,564 KB |
| testcase_02 | AC | 1,127 ms
48,420 KB |
| testcase_03 | AC | 1,435 ms
54,584 KB |
| testcase_04 | AC | 878 ms
25,472 KB |
| testcase_05 | AC | 858 ms
23,144 KB |
| testcase_06 | AC | 885 ms
22,864 KB |
| testcase_07 | AC | 862 ms
24,960 KB |
| testcase_08 | AC | 1,381 ms
60,928 KB |
| testcase_09 | AC | 1,419 ms
61,056 KB |
| testcase_10 | AC | 1,426 ms
58,668 KB |
| testcase_11 | AC | 897 ms
39,040 KB |
| testcase_12 | AC | 900 ms
38,528 KB |
| testcase_13 | AC | 1,419 ms
60,544 KB |
| testcase_14 | AC | 1,427 ms
60,544 KB |
| testcase_15 | AC | 963 ms
38,784 KB |
| testcase_16 | AC | 941 ms
38,912 KB |
| testcase_17 | AC | 932 ms
34,048 KB |
| testcase_18 | AC | 1,820 ms
60,672 KB |
| testcase_19 | AC | 1,853 ms
60,544 KB |
| testcase_20 | AC | 1,819 ms
60,532 KB |
| testcase_21 | AC | 1,788 ms
60,532 KB |
| testcase_22 | AC | 1,783 ms
60,416 KB |
| testcase_23 | AC | 1,680 ms
93,940 KB |
| testcase_24 | AC | 1,187 ms
45,340 KB |
| testcase_25 | AC | 1,221 ms
56,244 KB |
| testcase_26 | AC | 1,713 ms
83,604 KB |
| testcase_27 | AC | 1,714 ms
60,288 KB |
| testcase_28 | AC | 1,858 ms
66,024 KB |
| testcase_29 | AC | 1,782 ms
61,220 KB |
| testcase_30 | AC | 1,819 ms
71,088 KB |
| testcase_31 | AC | 1,743 ms
46,076 KB |
| testcase_32 | AC | 1,770 ms
47,036 KB |
| testcase_33 | TLE | - |
| testcase_34 | AC | 1,825 ms
48,644 KB |
| testcase_35 | AC | 1,819 ms
60,416 KB |
| testcase_36 | AC | 1,924 ms
55,680 KB |
| testcase_37 | AC | 1,865 ms
61,696 KB |
| testcase_38 | AC | 1,832 ms
47,300 KB |
| testcase_39 | AC | 1,782 ms
46,244 KB |
| testcase_40 | AC | 1,792 ms
78,336 KB |
| testcase_41 | AC | 1,825 ms
57,728 KB |
| testcase_42 | AC | 1,758 ms
46,276 KB |
| testcase_43 | AC | 236 ms
22,912 KB |
| testcase_44 | AC | 859 ms
54,524 KB |
| testcase_45 | AC | 856 ms
22,884 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var p = Enumerate(n, x => sc.Double() / 1000);
var q = Enumerate(n, x => sc.Double() / 100);
var pq = new PriorityQueue<KeyValuePair<int, double>>((l, r) => r.Value.CompareTo(l.Value));
for (int i = 0; i < n; i++)
pq.Enqueue(new KeyValuePair<int, double>(i, p[i] * q[i]));
var ans = 0.0;
for (int _ = 1; _ <= 5000000; _++)
{
var x = pq.Dequeue();
ans += _ * x.Value;
pq.Enqueue(new KeyValuePair<int, double>(x.Key, (1 - q[x.Key]) * x.Value));
}
IO.Printer.Out.WriteLine("{0:0.000000000000}",ans);
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region PriorityQueue and PairingHeap
public class PriorityQueue<T>
{
PairingHeap<T> top;
Comparison<T> compare;
int size;
public int Count { get { return size; } }
public PriorityQueue() : this(Comparer<T>.Default) { }
public PriorityQueue(Comparison<T> comparison) { compare = comparison; }
public PriorityQueue(IComparer<T> comparer) { compare = comparer.Compare; }
public void Enqueue(T item)
{
var heap = new PairingHeap<T>(item);
top = PairingHeap<T>.Merge(top, heap, compare);
size++;
}
public T Dequeue()
{
var ret = top.Key;
size--;
top = PairingHeap<T>.Pop(top, compare);
return ret;
}
public bool Any() { return size > 0; }
public T Peek() { return top.Key; }
}
#region PairingHeap
public class PairingHeap<T>
{
public PairingHeap(T k) { key = k; }
private readonly T key;
public T Key { get { return key; } }
private PairingHeap<T> head;
private PairingHeap<T> next;
static public PairingHeap<T> Pop(PairingHeap<T> s, Comparison<T> compare)
{
return MergeLst(s.head, compare);
}
static public PairingHeap<T> Merge(PairingHeap<T> l, PairingHeap<T> r, Comparison<T> compare)
{
if (l == null || r == null) return l == null ? r : l;
if (compare(l.key, r.key) > 0) Swap(ref l, ref r);
r.next = l.head;
l.head = r;
return l;
}
static public PairingHeap<T> MergeLst(PairingHeap<T> s, Comparison<T> compare)
{
var n = new PairingHeap<T>(default(T));
while (s != null)
{
PairingHeap<T> a = s, b = null;
s = s.next; a.next = null;
if (s != null) { b = s; s = s.next; b.next = null; }
a = Merge(a, b, compare); a.next = n.next;
n.next = a;
}
while (n.next != null)
{
var j = n.next;
n.next = n.next.next;
s = Merge(j, s, compare);
}
return s;
}
static void Swap(ref PairingHeap<T> l, ref PairingHeap<T> r) { var t = l; l = r; r = t; }
}
#endregion
#endregion