結果
問題 | No.463 魔法使いのすごろく🎲 |
ユーザー | eitaho |
提出日時 | 2016-12-14 01:53:58 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,516 bytes |
コンパイル時間 | 3,280 ms |
コンパイル使用メモリ | 110,080 KB |
実行使用メモリ | 20,096 KB |
最終ジャッジ日時 | 2024-05-07 13:43:16 |
合計ジャッジ時間 | 5,357 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
19,968 KB |
testcase_01 | AC | 27 ms
19,712 KB |
testcase_02 | AC | 26 ms
19,840 KB |
testcase_03 | AC | 27 ms
19,584 KB |
testcase_04 | AC | 30 ms
19,712 KB |
testcase_05 | AC | 28 ms
19,968 KB |
testcase_06 | AC | 27 ms
19,840 KB |
testcase_07 | AC | 28 ms
19,712 KB |
testcase_08 | AC | 27 ms
19,968 KB |
testcase_09 | AC | 27 ms
19,968 KB |
testcase_10 | AC | 27 ms
19,712 KB |
testcase_11 | AC | 28 ms
19,840 KB |
testcase_12 | AC | 27 ms
19,712 KB |
testcase_13 | AC | 26 ms
19,456 KB |
testcase_14 | AC | 28 ms
19,968 KB |
testcase_15 | AC | 27 ms
19,840 KB |
testcase_16 | AC | 26 ms
19,840 KB |
testcase_17 | AC | 28 ms
20,096 KB |
testcase_18 | AC | 27 ms
19,840 KB |
testcase_19 | AC | 26 ms
19,712 KB |
testcase_20 | WA | - |
testcase_21 | AC | 27 ms
20,096 KB |
testcase_22 | AC | 25 ms
19,072 KB |
testcase_23 | AC | 27 ms
19,584 KB |
testcase_24 | AC | 27 ms
19,968 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 28 ms
19,712 KB |
testcase_36 | AC | 27 ms
19,840 KB |
testcase_37 | AC | 27 ms
19,712 KB |
testcase_38 | AC | 27 ms
18,688 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.IO; using System.Linq; using System.Text; using System.Text.RegularExpressions; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; public class Program { int N, D; int[] Cost; double?[,] ans; public void Solve() { N = Reader.Int(); D = Reader.Int(); Cost = new[] { 0 }.Concat(Reader.IntArray(N - 2)).Concat(new[] { 0 }).ToArray(); ans = new double?[N, 2]; Console.WriteLine(Rec(0, 0)); } private double Rec(int at, int used) { if (at == N - 1) return 0; if (used == 0 && at + D >= N - 1) return Cost[at]; if (ans[at, used].HasValue) return ans[at, used].Value; var nextProb = new double[N]; for (int i = 1; i <= D; i++) { int next = at + i; if (next >= N) next = N - 2 - (next - N); nextProb[next] += 1.0 / D; } if (at + D >= N - 1) // && used == 1 { double ex = Cost[at]; for (int next = 0; next < N; next++) if (nextProb[next] > 0) ex += Cost[next] / nextProb[next]; ans[at, used] = ex; return ex; } double res0 = Cost[at]; double res1 = double.MaxValue; for (int next = 0; next < N; next++) if (next != at && nextProb[next] > 0) { res0 += nextProb[next] * Rec(next, used); if (used == 0) res1 = Math.Min(res1, Cost[at] + Rec(next, 1)); } res0 /= 1 - nextProb[at]; double res = Math.Min(res0, res1); ans[at, used] = res; return res; } } class Entry { static void Main() { new Program().Solve(); } } class Reader { static TextReader reader = Console.In; static readonly char[] separator = { ' ' }; static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; static string[] A = new string[0]; static int i; 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 Range(N, Int); } public static int[][] IntTable(int H) { return Range(H, IntLine); } public static string[] StringArray(int N) { return Range(N, Next); } public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); } public static string Line() { return reader.ReadLine().Trim(); } public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; } static string[] Split(string s) { return s.Split(separator, op); } static string Next() { CheckNext(); return A[i++]; } 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; } }