結果
問題 | No.194 フィボナッチ数列の理解(1) |
ユーザー | uwi |
提出日時 | 2015-04-26 22:21:33 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 118 ms / 5,000 ms |
コード長 | 4,707 bytes |
コンパイル時間 | 3,948 ms |
コンパイル使用メモリ | 81,828 KB |
実行使用メモリ | 59,460 KB |
最終ジャッジ日時 | 2024-07-05 02:57:36 |
合計ジャッジ時間 | 9,089 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
package contest;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class Q381 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();long K = nl();int[] a = na(n);int mod = 1000000007;if(n > 30){long[] cum = new long[(int)K+2];for(int i = 1;i <= n;i++){cum[i] = cum[i-1] + a[i-1];}long w = -1;for(int i = n+1;i <= K;i++){long v = cum[i-1] - cum[i-n-1];if(v < 0)v += mod;w = v;cum[i] = cum[i-1] + v;if(cum[i] >= mod)cum[i] -= mod;}out.println(w + " " + cum[(int)K]);}else{int[][] M = new int[n+1][n+1];for(int i = 0;i < n;i++)M[0][i] = 1;for(int i = 1;i < n;i++)M[i][i-1] = 1;for(int i = 0;i < n+1;i++)M[n][i] = 1;int[] v = new int[n+1];for(int i = 0;i < n;i++){v[n-1-i] = a[i];v[n] += a[i];}v = pow(M, v, K-n);out.println(v[0] + " " + v[n]);}}///////// beginpublic static final int mod = 1000000007;public static final long m2 = (long)mod*mod;public static final long BIG = 8L*m2;// A^e*vpublic static int[] pow(int[][] A, int[] v, long e){for(int i = 0;i < v.length;i++){if(v[i] >= mod)v[i] %= mod;}int[][] MUL = A;for(;e > 0;e>>>=1) {if((e&1)==1)v = mul(MUL, v);MUL = p2(MUL);}return v;}// int matrix*int vectorpublic static int[] mul(int[][] A, int[] v){int m = A.length;int n = v.length;int[] w = new int[m];for(int i = 0;i < m;i++){long sum = 0;for(int k = 0;k < n;k++){sum += (long)A[i][k] * v[k];if(sum >= BIG)sum -= BIG;}w[i] = (int)(sum % mod);}return w;}// int matrix^2 (be careful about negative value)public static int[][] p2(int[][] A){int n = A.length;int[][] C = new int[n][n];for(int i = 0;i < n;i++){long[] sum = new long[n];for(int k = 0;k < n;k++){for(int j = 0;j < n;j++){sum[j] += (long)A[i][k] * A[k][j];if(sum[j] >= BIG)sum[j] -= BIG;}}for(int j = 0;j < n;j++){C[i][j] = (int)(sum[j] % mod);}}return C;}//////////// endvoid run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");}public static void main(String[] args) throws Exception { new Q381().run(); }private byte[] inbuf = new byte[1024];private int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private char[][] nm(int n, int m){char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private int ni(){int num = 0, b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}