結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | eitaho |
提出日時 | 2015-04-27 19:31:44 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 964 ms / 5,000 ms |
コード長 | 4,897 bytes |
コンパイル時間 | 2,573 ms |
コンパイル使用メモリ | 109,988 KB |
実行使用メモリ | 31,484 KB |
最終ジャッジ日時 | 2023-09-18 13:53:51 |
合計ジャッジ時間 | 16,643 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
27,156 KB |
testcase_01 | AC | 71 ms
27,312 KB |
testcase_02 | AC | 964 ms
29,492 KB |
testcase_03 | AC | 133 ms
27,380 KB |
testcase_04 | AC | 391 ms
29,352 KB |
testcase_05 | AC | 302 ms
31,408 KB |
testcase_06 | AC | 357 ms
31,296 KB |
testcase_07 | AC | 572 ms
31,392 KB |
testcase_08 | AC | 117 ms
27,444 KB |
testcase_09 | AC | 425 ms
29,288 KB |
testcase_10 | AC | 221 ms
31,428 KB |
testcase_11 | AC | 208 ms
31,356 KB |
testcase_12 | AC | 316 ms
31,344 KB |
testcase_13 | AC | 161 ms
31,380 KB |
testcase_14 | AC | 88 ms
27,176 KB |
testcase_15 | AC | 649 ms
31,372 KB |
testcase_16 | AC | 556 ms
29,292 KB |
testcase_17 | AC | 204 ms
31,380 KB |
testcase_18 | AC | 608 ms
29,524 KB |
testcase_19 | AC | 860 ms
31,480 KB |
testcase_20 | AC | 98 ms
29,100 KB |
testcase_21 | AC | 109 ms
29,876 KB |
testcase_22 | AC | 99 ms
29,128 KB |
testcase_23 | AC | 83 ms
25,940 KB |
testcase_24 | AC | 94 ms
30,248 KB |
testcase_25 | AC | 93 ms
30,256 KB |
testcase_26 | AC | 95 ms
30,544 KB |
testcase_27 | AC | 93 ms
30,372 KB |
testcase_28 | AC | 84 ms
26,196 KB |
testcase_29 | AC | 104 ms
30,976 KB |
testcase_30 | AC | 885 ms
31,484 KB |
testcase_31 | AC | 71 ms
25,364 KB |
testcase_32 | AC | 295 ms
29,384 KB |
testcase_33 | AC | 382 ms
29,380 KB |
testcase_34 | AC | 319 ms
29,532 KB |
testcase_35 | AC | 296 ms
31,448 KB |
testcase_36 | AC | 705 ms
31,352 KB |
testcase_37 | AC | 114 ms
27,356 KB |
testcase_38 | AC | 738 ms
29,408 KB |
testcase_39 | AC | 333 ms
31,420 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.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { static readonly int SmallN = (int)1e6; static readonly int Mod = (int)1e9 + 7; public void Solve() { int L = Reader.Int(); long N = Reader.Long(); var F = new[] { 0 }.Concat(Reader.IntArray(L)).Concat(new int[SmallN]).ToArray(); var S = new int[SmallN + 1]; for (int i = 1; i <= L; i++) S[i] = (F[i] + S[i - 1]) % Mod; if (N <= SmallN) { for (int i = L + 1; i <= N; i++) { F[i] = (S[i - 1] - S[i - L - 1] + Mod) % Mod; S[i] = (F[i] + S[i - 1]) % Mod; } Console.WriteLine(F[N] + " " + S[N]); } else { var M = new long[L][]; for (int r = 0; r < L; r++) M[r] = new long[L]; for (int c = 0; c < L; c++) M[0][c] = 1; for (int r = 1; r < L; r++) M[r][r - 1] = 1; var MF = MatrixModPower(M, N - L, Mod); long f = 0; for (int i = 0; i < L; i++) f = (f + MF[0][i] * F[L - i]) % Mod; M = Rec(M, N - L, Mod); long s = S[L]; for (int c = 0; c < L; c++) s = (s + M[0][c] * F[L - c]) % Mod; Console.WriteLine(f + " " + s); } } long[][] Rec(long[][] A, long pow, long mod) { if (pow == 1) return A; int N = A.Length; var B = Rec(A, pow / 2, mod); var res = MatrixModMult(MatrixModPower(A, pow / 2, mod), B, mod); res = MatrixModAdd(res, B, mod); if (pow % 2 == 1) res = MatrixModAdd(res, MatrixModPower(A, pow, mod), mod); return res; } static long[][] MatrixModPower(long[][] A, long n, long mod) { int size = A.Length; long[][] res = new long[size][]; for (int i = 0; i < size; i++) { res[i] = new long[size]; res[i][i] = 1; } while (n > 0) { if ((n & 1) == 1) res = MatrixModMult(res, A, mod); A = MatrixModMult(A, A, mod); n >>= 1; } return res; } static long[][] MatrixModMult(long[][] A, long[][] B, long mod) { long[][] res = new long[A.Length][]; for (int i = 0; i < res.Length; i++) res[i] = new long[B[0].Length]; for (int i = 0; i < A.Length; i++) for (int k = 0; k < A[0].Length; k++) for (int j = 0; j < B[0].Length; j++) res[i][j] = (res[i][j] + A[i][k] * B[k][j]) % mod; return res; } static long[][] MatrixModAdd(long[][] A, long[][] B, long mod) { long[][] res = new long[A.Length][]; for (int i = 0; i < res.Length; i++) res[i] = new long[A[0].Length]; for (int r = 0; r < A.Length; r++) for (int c = 0; c < A[0].Length; c++) { if ((res[r][c] = A[r][c] + B[r][c]) >= mod) res[r][c] -= mod; if (res[r][c] < 0) res[r][c] += mod; } return res; } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }