結果

問題 No.720 行列のできるフィボナッチ数列道場 (2)
ユーザー EmKjpEmKjp
提出日時 2019-06-10 21:17:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 26 ms / 2,000 ms
コード長 7,249 bytes
コンパイル時間 2,367 ms
コンパイル使用メモリ 109,696 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-10-06 00:48:59
合計ジャッジ時間 2,259 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
17,792 KB
testcase_01 AC 24 ms
17,792 KB
testcase_02 AC 25 ms
17,920 KB
testcase_03 AC 26 ms
17,920 KB
testcase_04 AC 25 ms
17,664 KB
testcase_05 AC 25 ms
18,048 KB
testcase_06 AC 26 ms
18,048 KB
testcase_07 AC 25 ms
17,664 KB
testcase_08 AC 26 ms
18,048 KB
testcase_09 AC 25 ms
18,048 KB
testcase_10 AC 25 ms
17,920 KB
testcase_11 AC 26 ms
17,920 KB
testcase_12 AC 26 ms
18,048 KB
testcase_13 AC 25 ms
17,920 KB
testcase_14 AC 25 ms
18,048 KB
testcase_15 AC 26 ms
18,048 KB
testcase_16 AC 25 ms
18,048 KB
testcase_17 AC 26 ms
17,664 KB
testcase_18 AC 26 ms
17,792 KB
testcase_19 AC 25 ms
17,920 KB
testcase_20 AC 25 ms
18,048 KB
testcase_21 AC 25 ms
17,920 KB
testcase_22 AC 25 ms
18,048 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.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using E = System.Linq.Enumerable;

partial class Solver
{
    const int mod = 1000000007;
    public void Run()
    {
        var N = nl();
        var M = ni();

        var B = new ModMatrix(new long[2, 2]{
            { 0,1 },
            { 1,1 }
        }, mod);

        B = ModMatrix.Pow(B, M);

        var C = new ModMatrix(new long[3, 3]{
            { B[0,0],B[0,1], 0 },
            { B[1,0],B[1,1], 0 },
            {      1,     0, 1 }
        }, mod);

        var R = ModMatrix.Pow(C, N + 1) * new ModMatrix(new long[3, 1]
        {
            { 0 },
            { 1 },
            { 0 },
        }, mod);

        cout.WriteLine(R[0, 2]);
    }
}


public class ModMatrix
{
    public int Row { get; private set; }
    public int Col { get; private set; }
    public int Mod { get; private set; }
    private long[] Data;
    public ModMatrix(int row, int col, int mod)
    {
        this.Row = row;
        this.Col = col;
        this.Data = new long[Row * Col];
        this.Mod = mod;
    }

    public ModMatrix(long[,] array, int mod)
        : this(array.GetLength(0), array.GetLength(1), mod)
    {
        int index = 0;
        for (int i = 0; i < Row; i++)
        {
            for (int j = 0; j < Col; j++)
            {
                Data[index++] = array[i, j] % mod;
            }
        }
    }

    public long this[int row, int col]
    {
        set
        {
            Data[row * Col + col] = value;
        }
        get
        {
            return Data[row * Col + col];
        }
    }

    static public ModMatrix UnitMatrix(int n, int mod)
    {
        var matrix = new ModMatrix(n, n, mod);
        for (int i = 0; i < n; i++)
        {
            matrix[i, i] = 1;
        }
        return matrix;
    }

    static public ModMatrix operator +(ModMatrix A, ModMatrix B)
    {
        if (A.Mod != B.Mod) throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        var C = new ModMatrix(A.Row, A.Col, A.Mod);
        for (int i = 0; i < C.Data.Length; i++)
        {
            C.Data[i] = (A.Data[i] + B.Data[i] + A.Mod) % A.Mod;
        }
        return C;
    }

    static public ModMatrix operator -(ModMatrix A, ModMatrix B)
    {
        if (A.Mod != B.Mod) throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        var C = new ModMatrix(A.Row, A.Col, A.Mod);
        for (int i = 0; i < C.Data.Length; i++)
        {
            C.Data[i] = (A.Data[i] - B.Data[i] + A.Mod) % A.Mod;
        }
        return C;
    }

    static public ModMatrix operator *(ModMatrix A, ModMatrix B)
    {
        if (A.Mod != B.Mod) throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        var C = new ModMatrix(A.Row, B.Col, A.Mod);
        for (int i = 0; i < A.Row; i++)
        {
            for (int j = 0; j < B.Col; j++)
            {
                var val = C[i, j];
                for (int k = 0; k < A.Col; k++) val = (val + A[i, k] * B[k, j]) % A.Mod;
                if (val < 0) val += A.Mod;
                C[i, j] = val;
            }
        }
        return C;
    }

    static public ModMatrix Pow(ModMatrix A, long n)
    {
        if (n == 0) return UnitMatrix(A.Row, A.Mod);
        ModMatrix result = A.Clone(), t = A.Clone(); n--;
        while (n > 0)
        {
            if ((n & 1) != 0)
            {
                result = result * t;
            }
            t = t * t;
            n >>= 1;
        }

        return result;
    }

    public ModMatrix Clone()
    {
        return new ModMatrix(Row, Col, Mod) { Data = Data.Clone() as long[] };
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    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)
    {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.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 double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        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();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0