#345764 (C#(csc)) No.813 ユキちゃんの冒険

• 問題: No.813 ユキちゃんの冒険
• ユーザー: EmKjp
• 提出日時: 2019-05-09 00:48:35
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 32 ms / 2,000 ms
• コード長: 3,694 bytes
• コンパイル時間: 971 ms
• コンパイル使用メモリ: 114,336 KB
• 実行使用メモリ: 28,744 KB
• 最終ジャッジ日時: 2024-09-21 08:31:28
• 合計ジャッジ時間: 2,739 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	30 ms; 24,924 KB
testcase_01	AC	30 ms; 24,624 KB
testcase_02	AC	30 ms; 25,180 KB
testcase_03	AC	32 ms; 25,052 KB
testcase_04	AC	32 ms; 26,952 KB
testcase_05	AC	30 ms; 24,796 KB
testcase_06	AC	31 ms; 26,704 KB
testcase_07	AC	31 ms; 24,792 KB
testcase_08	AC	31 ms; 25,048 KB
testcase_09	AC	31 ms; 25,180 KB
testcase_10	AC	32 ms; 26,960 KB
testcase_11	AC	30 ms; 25,008 KB
testcase_12	AC	30 ms; 24,800 KB
testcase_13	AC	29 ms; 22,704 KB
testcase_14	AC	31 ms; 24,916 KB
testcase_15	AC	31 ms; 28,744 KB
testcase_16	AC	31 ms; 26,964 KB
testcase_17	AC	31 ms; 26,836 KB
testcase_18	AC	30 ms; 24,664 KB
testcase_19	AC	30 ms; 27,092 KB
testcase_20	AC	29 ms; 27,216 KB
testcase_21	AC	28 ms; 26,836 KB
testcase_22	AC	27 ms; 22,964 KB
testcase_23	AC	28 ms; 24,792 KB
testcase_24	AC	28 ms; 26,700 KB
testcase_25	AC	31 ms; 25,052 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.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;

partial class Solver
{
    double InfiniteGeometricProgressionSum(double x0, double r)
    {
        return x0 / (1.0 - r);
    }

    void Merge(double p1, double q1, double p2, double q2, out double rp, out double rq)
    {
        // back:
        // p1 +
        // q1 * p2 * q1 +
        // q1 * p2 * p1 * p2 * q1
        // ..
        // q1 * p2 * (p1 * p2)^K * q1
        rp = p1 + InfiniteGeometricProgressionSum(q1 * q1 * p2, p1 * p2);

        // forward
        // q1 +
        // q1 * q2
        // q1 * p2 * p1 * q2
        // ..
        // q1 * (p2 * p1) ^ K * q2
        rq = q1 + InfiniteGeometricProgressionSum(q1 * q2, p1 * p2);
    }

    public void Run()
    {
        var N = ni();
        var p = nd();
        var q = nd();

        double mergedP = p;
        double mergedQ = q;
        for (int i = 0; i < N - 1; i++)
        {
            Merge(mergedP, mergedQ, p, q, out p, out q);
        }
        cout.WriteLine(p);
    }
}

// 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;
        }
    }
}