結果

問題 No.194 フィボナッチ数列の理解(1)
ユーザー femtofemto
提出日時 2015-04-26 23:29:26
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 5,786 bytes
コンパイル時間 2,989 ms
コンパイル使用メモリ 109,100 KB
実行使用メモリ 39,704 KB
最終ジャッジ日時 2023-09-18 11:18:16
合計ジャッジ時間 7,408 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
21,844 KB
testcase_01 AC 63 ms
21,804 KB
testcase_02 AC 131 ms
19,892 KB
testcase_03 AC 70 ms
23,904 KB
testcase_04 AC 88 ms
21,848 KB
testcase_05 AC 84 ms
21,944 KB
testcase_06 AC 89 ms
21,916 KB
testcase_07 AC 104 ms
21,828 KB
testcase_08 AC 69 ms
21,860 KB
testcase_09 AC 94 ms
21,852 KB
testcase_10 AC 75 ms
21,980 KB
testcase_11 AC 76 ms
19,840 KB
testcase_12 AC 84 ms
23,908 KB
testcase_13 AC 72 ms
23,884 KB
testcase_14 AC 65 ms
21,884 KB
testcase_15 AC 115 ms
21,912 KB
testcase_16 AC 106 ms
21,912 KB
testcase_17 AC 74 ms
23,884 KB
testcase_18 AC 108 ms
21,852 KB
testcase_19 AC 126 ms
21,900 KB
testcase_20 AC 101 ms
39,028 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 93 ms
28,328 KB
testcase_27 AC 92 ms
29,936 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 126 ms
22,040 KB
testcase_31 AC 63 ms
21,888 KB
testcase_32 AC 80 ms
22,048 KB
testcase_33 AC 91 ms
23,920 KB
testcase_34 AC 85 ms
21,868 KB
testcase_35 AC 81 ms
21,864 KB
testcase_36 AC 111 ms
21,792 KB
testcase_37 AC 67 ms
21,848 KB
testcase_38 AC 118 ms
23,940 KB
testcase_39 AC 84 ms
21,908 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.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;

class Solution {
    long MOD = (long)1e9 + 7;
    long N, K;
    int[] A;
    void calc() {
        rlo(out N, out K);
        A = ria((int)N);

        if(K <= (int)1e6) {
            long[] f = new long[K + 1], s = new long[K + 1];
            for(int i = 1; i <= K; i++) {
                if(i <= N)
                    f[i] = A[i - 1];
                else
                    f[i] = (s[i - 1] - s[i - N - 1]) % MOD;
                s[i] = (s[i - 1] + f[i]) % MOD;
            }
            Console.WriteLine(f[K] + " " + s[K]);
            return;
        }
        else {
            long[,] M = new long[N + 1, N + 1];
            for(int i = 0; i < N - 1; i++) {
                M[i, i + 1] = 1;
            }
            for(int i = 0; i < N; i++) {
                M[N - 1, i] = 1;
            }
            M[N, 0] = M[N, N] = 1;
            M = Algorithm.Matrix.Pow(M, K - N);

            long[,] a = new long[N + 1, 1];
            for(int i = 0; i < N; i++)
                a[i, 0] = A[i];

            var b = Algorithm.Matrix.mul(M, a);
            long s = 0;
            for(int i = 0; i <= N; i++)
                s = (s + b[i, 0]) % MOD;

            Console.WriteLine(b[N - 1, 0] + " " + s);
        }

    }

    static void Main(string[] args) {
        new Solution().calc();
    }

    #region
    static int ri() { return int.Parse(Console.ReadLine()); }
    static int[] ria(int n) {
        if(n <= 0) { Console.ReadLine(); return new int[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
    }
    static void rio(out int p1) { p1 = ri(); }
    static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
    static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static long[] rla(int n) {
        if(n <= 0) { Console.ReadLine(); return new long[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
    }
    static void rlo(out long p1) { p1 = rl(); }
    static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
    static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static double[] rda(int n) {
        if(n <= 0) { Console.ReadLine(); return new double[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
    }
    static void rdo(out double p1) { p1 = rd(); }
    static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
    static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
    static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
    static void wa2<T>(T[][] a) {
        foreach(var row in a) {
            Debug.WriteLine(String.Join(" ", row));
        }
    }
    [DebuggerDisplay("{x} , {y}")]
    class point<T> {
        public T x, y;
        public point(T x, T y) {
            this.x = x; this.y = y;
        }
    }
    #endregion
}

namespace Algorithm {
    using T = System.Int64;
    static class Matrix {
        static T MOD = (T)1e9 + 7;
        public static T[,] mul(T[,] a, T[,] b) {
            int n = a.GetLength(0), m = b.GetLength(1), l = a.GetLength(1);
            T[,] c = new T[n, m];
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < m; j++) {
                    for(int k = 0; k < l; k++) {
                        c[i, j] = (c[i, j] + (a[i, k] * b[k, j]) % MOD) % MOD;
                    }
                }
            }
            return c;
        }
        public static T[,] Pow(T[,] a, long n) {
            int dim = a.GetLength(0);
            var b = new T[dim, dim];
            for(int i = 0; i < dim; i++) b[i, i] = 1;

            while(n > 0) {
                if((n & 1) > 0) b = mul(a, b);
                a = mul(a, a);
                n >>= 1;
            }
            return b;
        }
    }

}

static class Extention {
    public static T[][] ToJagArray<T>(this T[,] a) {
        int n = a.GetLength(0), m = a.GetLength(1);
        var ret = new T[n][];
        for(int i = 0; i < n; i++) {
            ret[i] = new T[m];
            for(int j = 0; j < m; j++) {
                ret[i][j] = a[i, j];
            }
        }
        return ret;
    }

    public static bool InRange<T>(this T[,] a, int i, int j) {
        int n = a.GetLength(0), m = a.GetLength(1);
        return 0 <= i && i < n && 0 <= j && j < m;
    }
}
0