結果
問題 | No.891 隣接3項間の漸化式 |
ユーザー | uwi |
提出日時 | 2019-09-20 21:27:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 4,288 bytes |
コンパイル時間 | 3,954 ms |
コンパイル使用メモリ | 88,584 KB |
実行使用メモリ | 36,992 KB |
最終ジャッジ日時 | 2024-09-14 16:20:20 |
合計ジャッジ時間 | 7,298 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,864 KB |
testcase_01 | AC | 52 ms
36,664 KB |
testcase_02 | AC | 54 ms
36,968 KB |
testcase_03 | AC | 52 ms
36,288 KB |
testcase_04 | AC | 52 ms
36,664 KB |
testcase_05 | AC | 52 ms
36,416 KB |
testcase_06 | AC | 52 ms
36,532 KB |
testcase_07 | AC | 54 ms
36,756 KB |
testcase_08 | AC | 52 ms
36,816 KB |
testcase_09 | AC | 53 ms
36,756 KB |
testcase_10 | AC | 52 ms
36,532 KB |
testcase_11 | AC | 53 ms
36,592 KB |
testcase_12 | AC | 51 ms
36,420 KB |
testcase_13 | AC | 53 ms
36,756 KB |
testcase_14 | AC | 52 ms
36,416 KB |
testcase_15 | AC | 53 ms
36,584 KB |
testcase_16 | AC | 53 ms
36,544 KB |
testcase_17 | AC | 53 ms
36,756 KB |
testcase_18 | AC | 51 ms
36,784 KB |
testcase_19 | AC | 52 ms
36,756 KB |
testcase_20 | AC | 52 ms
36,488 KB |
testcase_21 | AC | 53 ms
36,520 KB |
testcase_22 | AC | 51 ms
36,992 KB |
testcase_23 | AC | 51 ms
36,376 KB |
testcase_24 | AC | 52 ms
36,740 KB |
testcase_25 | AC | 54 ms
36,592 KB |
testcase_26 | AC | 53 ms
36,592 KB |
testcase_27 | AC | 53 ms
36,552 KB |
testcase_28 | AC | 52 ms
36,676 KB |
testcase_29 | AC | 53 ms
36,784 KB |
testcase_30 | AC | 52 ms
36,812 KB |
testcase_31 | AC | 50 ms
36,856 KB |
testcase_32 | AC | 52 ms
36,964 KB |
testcase_33 | AC | 53 ms
36,816 KB |
testcase_34 | AC | 52 ms
36,808 KB |
testcase_35 | AC | 51 ms
36,744 KB |
testcase_36 | AC | 52 ms
36,712 KB |
testcase_37 | AC | 51 ms
36,904 KB |
testcase_38 | AC | 52 ms
36,900 KB |
testcase_39 | AC | 52 ms
36,968 KB |
testcase_40 | AC | 52 ms
36,660 KB |
testcase_41 | AC | 51 ms
36,528 KB |
ソースコード
package contest190920; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int a = ni(), b = ni(), n = ni(); int[][] M = { {a, b}, {1, 0} }; out.println(pow(M, new int[] {1, 0}, n)[1]); } public static final int mod = 1000000007; public static final long m2 = (long)mod*mod; public static final long BIG = 8L*m2; // A^e*v public 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 vector public 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; } void 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new E().run(); } private byte[] inbuf = new byte[1024]; public 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }