#203124 (Java21) No.569 3 x N グリッドのパスの数

提出ソース

結果

問題	No.569 3 x N グリッドのパスの数
ユーザー	uwi
提出日時	2017-09-08 22:53:00
言語	Java21 (openjdk 21)
結果	AC
実行時間	59 ms / 2,000 ms
コード長	5,031 bytes
コンパイル時間	7,218 ms
コンパイル使用メモリ	85,304 KB
実行使用メモリ	37,432 KB
最終ジャッジ日時	2024-11-07 05:49:15
合計ジャッジ時間	9,606 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 36,980 KB
testcase_01	AC	52 ms 36,968 KB
testcase_02	AC	51 ms 36,716 KB
testcase_03	AC	51 ms 37,040 KB
testcase_04	AC	51 ms 36,764 KB
testcase_05	AC	51 ms 37,336 KB
testcase_06	AC	52 ms 37,192 KB
testcase_07	AC	51 ms 36,696 KB
testcase_08	AC	52 ms 36,820 KB
testcase_09	AC	51 ms 36,708 KB
testcase_10	AC	51 ms 36,852 KB
testcase_11	AC	52 ms 37,084 KB
testcase_12	AC	51 ms 37,076 KB
testcase_13	AC	52 ms 37,300 KB
testcase_14	AC	52 ms 36,708 KB
testcase_15	AC	51 ms 36,964 KB
testcase_16	AC	51 ms 36,948 KB
testcase_17	AC	52 ms 36,752 KB
testcase_18	AC	53 ms 37,064 KB
testcase_19	AC	53 ms 37,212 KB
testcase_20	AC	55 ms 37,036 KB
testcase_21	AC	55 ms 37,024 KB
testcase_22	AC	54 ms 37,216 KB
testcase_23	AC	54 ms 36,948 KB
testcase_24	AC	55 ms 36,876 KB
testcase_25	AC	54 ms 37,096 KB
testcase_26	AC	55 ms 37,024 KB
testcase_27	AC	54 ms 36,892 KB
testcase_28	AC	55 ms 37,228 KB
testcase_29	AC	54 ms 37,028 KB
testcase_30	AC	53 ms 37,168 KB
testcase_31	AC	54 ms 37,096 KB
testcase_32	AC	55 ms 36,956 KB
testcase_33	AC	55 ms 37,120 KB
testcase_34	AC	54 ms 36,788 KB
testcase_35	AC	55 ms 36,840 KB
testcase_36	AC	55 ms 36,940 KB
testcase_37	AC	55 ms 37,224 KB
testcase_38	AC	54 ms 37,092 KB
testcase_39	AC	55 ms 37,020 KB
testcase_40	AC	56 ms 36,824 KB
testcase_41	AC	58 ms 37,248 KB
testcase_42	AC	58 ms 37,048 KB
testcase_43	AC	57 ms 37,244 KB
testcase_44	AC	56 ms 37,156 KB
testcase_45	AC	57 ms 36,988 KB
testcase_46	AC	57 ms 37,216 KB
testcase_47	AC	57 ms 37,428 KB
testcase_48	AC	58 ms 37,008 KB
testcase_49	AC	59 ms 37,120 KB
testcase_50	AC	58 ms 37,064 KB
testcase_51	AC	58 ms 36,816 KB
testcase_52	AC	57 ms 37,260 KB
testcase_53	AC	58 ms 37,288 KB
testcase_54	AC	58 ms 37,392 KB
testcase_55	AC	57 ms 36,992 KB
testcase_56	AC	56 ms 36,696 KB
testcase_57	AC	58 ms 37,280 KB
testcase_58	AC	57 ms 37,432 KB
testcase_59	AC	56 ms 37,020 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest170908;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// 0...
		// .0..
		// ..0.
		// ...0
		// 011.
		// 0.11
		// 01.1
		// .011
		// 110.
		// 1.10
		// 11.0
		// .110
		int[][] M = new int[12][12];
		for(int i = 0;i < 4;i++){
			for(int j = 0;j < 4;j++){
				M[j][i] = 1;
			}
		}
		M[4][0] = 1;
		M[5][0] = M[5][1] = 1;
		M[6][0] = 1;
		M[7][0] = M[7][1] = 1;
		
		M[8][2] = M[8][3] = 1;
		M[9][3] = 1;
		M[10][3] = M[10][2] = 1;
		M[11][3] = 1;
		
		M[2][4] = M[3][4] = M[4][4] = M[6][4] = 1;
		M[3][5] = M[5][5] = M[6][5] = M[7][5] = 1;
		M[2][6] = M[3][6] = M[4][6] = M[5][6] = M[6][6] = 1;
		M[3][7] = M[5][7] = M[7][7] = 1;
		
		M[0][8] = M[10][8] = M[8][8] = 1;
		M[0][9] = M[1][9] = M[11][9] = M[10][9] = M[9][9] = 1;
		M[0][10] = M[10][10] = M[9][10] = M[8][10] = 1;
		M[0][11] = M[1][11] = M[11][11] = M[9][11] = 1;
		
		
		long n = nl();
		int[] v = new int[12];
		v[0] = 1;
		out.println(pow(M, v, n+1)[3]);
	}
	
	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 F().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)); }
}

yukicoder

結果

テストケース

ソースコード