結果

問題 No.813 ユキちゃんの冒険
ユーザー claw88claw88
提出日時 2019-04-12 22:24:39
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,968 ms / 2,000 ms
コード長 4,367 bytes
コンパイル時間 3,076 ms
コンパイル使用メモリ 113,824 KB
実行使用メモリ 28,028 KB
最終ジャッジ日時 2024-09-21 08:29:03
合計ジャッジ時間 57,138 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,967 ms
25,824 KB
testcase_01 AC 1,966 ms
26,156 KB
testcase_02 AC 1,967 ms
26,160 KB
testcase_03 AC 1,968 ms
27,864 KB
testcase_04 AC 1,968 ms
25,952 KB
testcase_05 AC 1,968 ms
27,864 KB
testcase_06 AC 1,968 ms
26,032 KB
testcase_07 AC 1,966 ms
26,084 KB
testcase_08 AC 1,967 ms
26,140 KB
testcase_09 AC 1,967 ms
26,104 KB
testcase_10 AC 1,966 ms
26,156 KB
testcase_11 AC 1,966 ms
26,224 KB
testcase_12 AC 1,967 ms
25,960 KB
testcase_13 AC 1,967 ms
28,000 KB
testcase_14 AC 1,965 ms
26,116 KB
testcase_15 AC 1,967 ms
24,244 KB
testcase_16 AC 1,966 ms
25,956 KB
testcase_17 AC 1,967 ms
27,864 KB
testcase_18 AC 1,966 ms
26,100 KB
testcase_19 AC 1,967 ms
26,108 KB
testcase_20 AC 1,966 ms
28,024 KB
testcase_21 AC 1,966 ms
28,028 KB
testcase_22 AC 1,967 ms
25,952 KB
testcase_23 AC 1,966 ms
23,856 KB
testcase_24 AC 1,967 ms
27,988 KB
testcase_25 AC 1,968 ms
25,892 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.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        var sp = new Stopwatch();
        sp.Start();
        int N = cin.nextint;
        var p = cin.nextdouble;
        var q = cin.nextdouble;

        var rnd = new Random();
        int ok = 0;
        for (int t = 1; ; t++)
        {
            int k = 1;
            bool ri = true;

            while (true)
            {
                var r = rnd.NextDouble();
                if (r < p)
                {
                    ri = !ri;

                    if (ri) k++;
                    else k--;
                }
                else if (r < p + q)
                {
                    if (ri) k++;
                    else k--;
                }
                else
                {
                    break;
                }
                if (k == 0)
                {
                    ok++;
                    break;
                }
                if (k == N + 1)
                {
                    break;
                }

            }

            if (sp.ElapsedMilliseconds > 1950)
            {
                WriteLine(((double)ok / t).ToString("F4"));
                return;
            }

        }
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0