結果
問題 | No.813 ユキちゃんの冒険 |
ユーザー |
![]() |
提出日時 | 2019-04-14 16:20:42 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,575 ms / 2,000 ms |
コード長 | 3,982 bytes |
コンパイル時間 | 1,938 ms |
コンパイル使用メモリ | 110,848 KB |
実行使用メモリ | 19,712 KB |
最終ジャッジ日時 | 2025-01-27 09:14:52 |
合計ジャッジ時間 | 8,065 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 |
コンパイルメッセージ
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.Trace;using SB = System.Text.StringBuilder;//using System.Numerics;using static System.Math;using Number = System.Int64;namespace Program {public class Solver {Random rnd = new Random(0);public void Solve() {var n = ri;var p = rd;var q = rd;var dpL = new double[n + 5];var dpR = new double[n + 5];for (int i = 0; i <= n + 1; i++) {dpL[i] = rnd.NextDouble();dpR[i] = rnd.NextDouble();}dpL[0] = 0; dpR[n + 1] = 0;dpL[n + 1] = 0; dpR[0] = 1;for (int k = 0; k < 20000; k++) {for (int i = 1; i <= n; i++) {dpL[i] = q * dpL[i + 1] + p * dpR[i - 1];dpR[i] = q * dpR[i - 1] + p * dpL[i + 1];}}Console.WriteLine(dpL[1]);}const long INF = 1L << 60;int ri => sc.Integer();long rl => sc.Long();double rd => sc.Double();string rs => sc.Scan();public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());static IEnumerable<int> Rep(int n) => Enumerable.Range(0, n);static IEnumerable<int> RRep(int n) => Enumerable.Range(0, n).Reverse();static T[] Enumerate<T>(int n, Func<int, T> f) {var a = new T[n];for (int i = 0; i < a.Length; ++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 mainstatic class Ex {static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {return string.Join(st, ie);}static public void Main() {Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });var solver = new Program.Solver();solver.Solve();Console.Out.Flush();}}#endregion#region Exnamespace Program.IO {using System.IO;using System.Text;using System.Globalization;public class Printer : StreamWriter {public override IFormatProvider FormatProvider => CultureInfo.InvariantCulture;public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }}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;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 string ScanLine() {var sb = new StringBuilder();for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);return sb.ToString();}public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }}}#endregion