結果
問題 | No.579 3 x N グリッド上のサイクルのサイズ(hard) |
ユーザー |
|
提出日時 | 2017-10-13 22:52:53 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 79 ms / 2,000 ms |
コード長 | 5,330 bytes |
コンパイル時間 | 4,244 ms |
コンパイル使用メモリ | 87,268 KB |
実行使用メモリ | 38,132 KB |
最終ジャッジ日時 | 2024-11-17 11:38:58 |
合計ジャッジ時間 | 10,684 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 80 |
ソースコード
package contest171013;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 C {InputStream is;PrintWriter out;String INPUT = "";void solve(){long n = nl();// 1100// 0110// 0011// 1010// 0101// 1001// 1122// 1221int[][] M = new int[20][20];int[] v = new int[20];v[18] = 1;a(M, 8, 8, 0);a(M, 9, 9, 0);a(M, 8, 0, 2); a(M, 0, 9, 2);a(M, 8, 1, 2); a(M, 1, 9, 2);a(M, 8, 2, 2); a(M, 2, 9, 2);a(M, 8, 3, 3); a(M, 3, 9, 3);a(M, 8, 4, 3); a(M, 4, 9, 3);a(M, 8, 5, 4); a(M, 5, 9, 4);a(M, 8, 6, 4);a(M, 7, 9, 4);a(M, 0, 0, 2);a(M, 0, 3, 3);a(M, 0, 5, 4);a(M, 0, 6, 4);a(M, 1, 1, 2);a(M, 1, 3, 3);a(M, 1, 4, 3);a(M, 1, 5, 4);a(M, 2, 2, 2);a(M, 2, 4, 3);a(M, 2, 5, 4);a(M, 2, 6, 4);a(M, 3, 0, 3);a(M, 3, 1, 3);a(M, 3, 3, 2);a(M, 3, 4, 4);a(M, 3, 5, 3);a(M, 4, 1, 3);a(M, 4, 2, 3);a(M, 4, 3, 4);a(M, 4, 4, 2);a(M, 4, 5, 3);a(M, 5, 0, 4);a(M, 5, 1, 4);a(M, 5, 2, 4);a(M, 5, 3, 3);a(M, 5, 4, 3);a(M, 5, 5, 2);a(M, 5, 7, 4);a(M, 6, 5, 4);a(M, 6, 6, 4);a(M, 7, 0, 4);a(M, 7, 2, 4);a(M, 7, 7, 4);int[] ret = pow(M, v, n+1);out.println(ret[9]);}void a(int[][] M, int f, int t, int mul){M[t][f] = 1;M[t+10][f+10] = 1;M[t][f+10] = mul;}public 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;}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 C().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)); }}