結果
問題 | No.813 ユキちゃんの冒険 |
ユーザー | EmKjp |
提出日時 | 2019-05-09 00:00:46 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,417 bytes |
コンパイル時間 | 2,248 ms |
コンパイル使用メモリ | 107,768 KB |
実行使用メモリ | 26,788 KB |
最終ジャッジ日時 | 2023-08-30 15:22:12 |
合計ジャッジ時間 | 6,875 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
22,600 KB |
testcase_01 | AC | 69 ms
22,752 KB |
testcase_02 | AC | 146 ms
22,752 KB |
testcase_03 | AC | 105 ms
20,748 KB |
testcase_04 | AC | 201 ms
20,644 KB |
testcase_05 | AC | 248 ms
22,840 KB |
testcase_06 | AC | 124 ms
22,636 KB |
testcase_07 | AC | 81 ms
24,780 KB |
testcase_08 | AC | 201 ms
26,788 KB |
testcase_09 | AC | 76 ms
24,792 KB |
testcase_10 | AC | 115 ms
24,804 KB |
testcase_11 | AC | 100 ms
20,692 KB |
testcase_12 | AC | 159 ms
24,652 KB |
testcase_13 | AC | 160 ms
24,776 KB |
testcase_14 | AC | 70 ms
24,796 KB |
testcase_15 | AC | 261 ms
24,740 KB |
testcase_16 | AC | 231 ms
22,736 KB |
testcase_17 | AC | 87 ms
24,676 KB |
testcase_18 | AC | 73 ms
22,656 KB |
testcase_19 | AC | 199 ms
24,716 KB |
testcase_20 | AC | 106 ms
22,676 KB |
testcase_21 | AC | 85 ms
22,636 KB |
testcase_22 | AC | 83 ms
24,668 KB |
testcase_23 | AC | 132 ms
22,648 KB |
testcase_24 | AC | 67 ms
24,792 KB |
testcase_25 | WA | - |
コンパイルメッセージ
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.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { public void Run() { // E[0] = 1 // E[1] = p * E[ 0] + q * E[ 2] // ... // E[N] = p * E[N-1] + q * E[N+1] // E[N+1] = 0 var N = ni(); var p = nd(); var q = nd(); var E = new double[N + 2, 2]; E[0, 0] = 1; E[0, 1] = 1; E[N + 1, 0] = 0; E[N + 1, 1] = 0; for (int j = 0; j < 10000; j++) { for (int i = 1; i <= N; i++) { E[i, 0] = p * E[i - 1, 1] + q * E[i + 1, 0]; E[i, 1] = p * E[i + 1, 0] + q * E[i - 1, 1]; } } cout.WriteLine(E[1, 0]); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { 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 double nd() { return NextDouble(); } public string ns() { return Next(); } public string[] ns(int n) { return NextArray(n); } } 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; } } }