結果

問題 No.834 Random Walk Trip
ユーザー EmKjpEmKjp
提出日時 2019-05-25 00:19:27
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 150 ms / 2,000 ms
コード長 4,794 bytes
コンパイル時間 2,424 ms
コンパイル使用メモリ 113,116 KB
実行使用メモリ 46,724 KB
最終ジャッジ日時 2023-10-17 15:10:54
合計ジャッジ時間 3,295 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
24,184 KB
testcase_01 AC 24 ms
24,184 KB
testcase_02 AC 23 ms
24,184 KB
testcase_03 AC 23 ms
24,184 KB
testcase_04 AC 25 ms
24,192 KB
testcase_05 AC 24 ms
24,192 KB
testcase_06 AC 24 ms
24,192 KB
testcase_07 AC 24 ms
24,192 KB
testcase_08 AC 24 ms
24,192 KB
testcase_09 AC 25 ms
24,192 KB
testcase_10 AC 24 ms
24,192 KB
testcase_11 AC 25 ms
24,192 KB
testcase_12 AC 24 ms
24,192 KB
testcase_13 AC 25 ms
24,192 KB
testcase_14 AC 24 ms
24,192 KB
testcase_15 AC 25 ms
24,192 KB
testcase_16 AC 25 ms
24,192 KB
testcase_17 AC 29 ms
24,804 KB
testcase_18 AC 39 ms
27,416 KB
testcase_19 AC 115 ms
46,724 KB
testcase_20 AC 40 ms
27,212 KB
testcase_21 AC 112 ms
46,028 KB
testcase_22 AC 25 ms
24,192 KB
testcase_23 AC 126 ms
41,528 KB
testcase_24 AC 29 ms
24,336 KB
testcase_25 AC 150 ms
46,724 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.Globalization;
using System.IO;
using System.Linq;

partial class Solver
{
    public void Run()
    {
        var N = ni();
        var M = ni();

        int mod = 1000000007;
        long ans = 0;
        if (N == 1) ans = 1;
        else
        {
            var C = new Binomial(M + 1, mod);
            var pattern = new Func<int, long>(x =>
            {
                if (x < 0) x = -x;
                if ((M + x) % 2 == 1) return 0;
                var a = (M + x) / 2;
                return C[M, a];
            }
            );
            for (int i = -M; i <= M; i++)
            {
                var r = i % (2 * N);
                if (r < 0) r += 2 * N;
                if (r == 0 || r == 2 * N - 1)
                {
                    ans += pattern(i);
                    ans %= mod;
                }
            }
        }
        cout.WriteLine(ans);

    }
}

public class Binomial
{
    private readonly long[] factorial;
    private readonly long[] inverseFactorial;
    private readonly long[] inverse;
    private readonly int mod;

    public Binomial(int size, int primeMod)
    {
        size++;
        this.factorial = new long[size];
        this.inverseFactorial = new long[size];
        this.inverse = new long[size];
        this.mod = primeMod;
        Setup(size);
    }

    private void Setup(int size)
    {
        factorial[0] = factorial[1] = 1;
        inverseFactorial[0] = inverseFactorial[1] = 1;
        inverse[1] = 1;
        for (int i = 2; i < size; i++)
        {
            factorial[i] = factorial[i - 1] * i % mod;
            inverse[i] = (mod - (mod / i) * inverse[mod % i] % mod);
            inverseFactorial[i] = inverseFactorial[i - 1] * inverse[i] % mod;
        }
    }

    private long Get(int s, int t)
    {
        if (s < 0 || t < 0 || s < t) return 0;
        if (t == 0 || s == t) return 1;
        if (s >= mod) return Get(s % mod, t % mod) * Get(s / mod, t / mod) % mod; // Lucas' theorem
        return factorial[s] * inverseFactorial[t] % mod * inverseFactorial[s - t] % mod;
    }

    public long this[int s, int t]
    {
        get
        {
            return Get(s, t);
        }
    }

}

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