結果
問題 | No.314 ケンケンパ |
ユーザー | uwi |
提出日時 | 2015-12-07 00:08:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 72 ms / 1,000 ms |
コード長 | 4,164 bytes |
コンパイル時間 | 4,689 ms |
コンパイル使用メモリ | 94,164 KB |
実行使用メモリ | 38,176 KB |
最終ジャッジ日時 | 2024-09-14 16:38:48 |
合計ジャッジ時間 | 6,622 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
37,872 KB |
testcase_01 | AC | 69 ms
38,156 KB |
testcase_02 | AC | 67 ms
37,900 KB |
testcase_03 | AC | 70 ms
37,972 KB |
testcase_04 | AC | 72 ms
38,140 KB |
testcase_05 | AC | 69 ms
37,700 KB |
testcase_06 | AC | 68 ms
37,720 KB |
testcase_07 | AC | 68 ms
38,156 KB |
testcase_08 | AC | 68 ms
37,852 KB |
testcase_09 | AC | 70 ms
37,912 KB |
testcase_10 | AC | 71 ms
38,016 KB |
testcase_11 | AC | 68 ms
38,116 KB |
testcase_12 | AC | 68 ms
37,416 KB |
testcase_13 | AC | 71 ms
37,996 KB |
testcase_14 | AC | 68 ms
37,980 KB |
testcase_15 | AC | 69 ms
38,008 KB |
testcase_16 | AC | 67 ms
37,796 KB |
testcase_17 | AC | 68 ms
37,972 KB |
testcase_18 | AC | 69 ms
38,176 KB |
testcase_19 | AC | 66 ms
37,568 KB |
ソースコード
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 CopyOfAdv6 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { // a[i]=a[i-2]+a[i-3] int mod = 1000000007; int n = ni(); int[][] M = { {0, 1, 1}, {1, 0, 0}, {0, 1, 0} }; int[] v = {1, 0, 0}; out.println(Arrays.stream(pow(M, v, n)).mapToLong(x -> x).sum() % mod); } 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"); } public static void main(String[] args) throws Exception { new CopyOfAdv6().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)); } }