#225284 (Java21) No.621 3 x N グリッド上のドミノの置き方の数

提出ソース

結果

問題	No.621 3 x N グリッド上のドミノの置き方の数
ユーザー	uwi
提出日時	2017-12-21 00:10:20
言語	Java21 (openjdk 21)
結果	AC
実行時間	147 ms / 3,000 ms
コード長	5,157 bytes
コンパイル時間	6,125 ms
コンパイル使用メモリ	78,356 KB
実行使用メモリ	54,416 KB
最終ジャッジ日時	2023-08-22 11:07:01
合計ジャッジ時間	16,758 ms
ジャッジサーバーID （参考情報）	judge14 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	71 ms 50,936 KB
testcase_01	AC	82 ms 51,884 KB
testcase_02	AC	68 ms 51,268 KB
testcase_03	AC	70 ms 51,528 KB
testcase_04	AC	71 ms 51,304 KB
testcase_05	AC	73 ms 51,208 KB
testcase_06	AC	74 ms 51,536 KB
testcase_07	AC	76 ms 51,840 KB
testcase_08	AC	74 ms 51,264 KB
testcase_09	AC	80 ms 51,780 KB
testcase_10	AC	80 ms 49,948 KB
testcase_11	AC	77 ms 51,404 KB
testcase_12	AC	78 ms 51,784 KB
testcase_13	AC	99 ms 51,916 KB
testcase_14	AC	110 ms 51,904 KB
testcase_15	AC	116 ms 51,972 KB
testcase_16	AC	109 ms 51,996 KB
testcase_17	AC	118 ms 52,348 KB
testcase_18	AC	119 ms 51,908 KB
testcase_19	AC	119 ms 51,964 KB
testcase_20	AC	125 ms 53,888 KB
testcase_21	AC	120 ms 52,336 KB
testcase_22	AC	124 ms 53,876 KB
testcase_23	AC	123 ms 54,008 KB
testcase_24	AC	127 ms 53,900 KB
testcase_25	AC	132 ms 54,108 KB
testcase_26	AC	129 ms 53,964 KB
testcase_27	AC	140 ms 53,856 KB
testcase_28	AC	144 ms 53,860 KB
testcase_29	AC	144 ms 53,876 KB
testcase_30	AC	143 ms 54,116 KB
testcase_31	AC	141 ms 54,184 KB
testcase_32	AC	129 ms 54,352 KB
testcase_33	AC	142 ms 54,404 KB
testcase_34	AC	141 ms 54,076 KB
testcase_35	AC	133 ms 54,416 KB
testcase_36	AC	144 ms 54,032 KB
testcase_37	AC	145 ms 51,976 KB
testcase_38	AC	143 ms 54,032 KB
testcase_39	AC	142 ms 53,964 KB
testcase_40	AC	140 ms 53,888 KB
testcase_41	AC	141 ms 53,976 KB
testcase_42	AC	143 ms 53,972 KB
testcase_43	AC	142 ms 54,016 KB
testcase_44	AC	142 ms 53,920 KB
testcase_45	AC	143 ms 54,384 KB
testcase_46	AC	146 ms 54,344 KB
testcase_47	AC	147 ms 52,316 KB
testcase_48	AC	143 ms 53,932 KB
testcase_49	AC	134 ms 53,888 KB
testcase_50	AC	144 ms 54,300 KB
testcase_51	AC	142 ms 53,968 KB
testcase_52	AC	145 ms 54,084 KB
testcase_53	AC	141 ms 54,348 KB
testcase_54	AC	144 ms 54,064 KB
testcase_55	AC	141 ms 53,968 KB
testcase_56	AC	141 ms 54,016 KB
testcase_57	AC	133 ms 54,036 KB
testcase_58	AC	134 ms 53,884 KB
testcase_59	AC	142 ms 54,224 KB
testcase_60	AC	143 ms 53,960 KB
testcase_61	AC	143 ms 53,940 KB
testcase_62	AC	136 ms 53,888 KB
testcase_63	AC	126 ms 53,832 KB
testcase_64	AC	128 ms 54,380 KB
testcase_65	AC	127 ms 53,952 KB
testcase_66	AC	131 ms 54,012 KB
testcase_67	AC	128 ms 53,968 KB

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

ソースコード

raw source code

package adv2017;
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 N621 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl();
		int mod = 1000000007;
		// 3 4 5
		// 0 1 2
		int[][] M = new int[1<<6][1<<6];
		for(int i = 0;i < 1<<6;i++){
			int ni = i<<3;
			int[] can = {9, 18, 36, 3, 6};
			dfs(ni, 0, can, M, i);
		}
		
		
		int[] v = new int[64];
		v[63] = 1;
		v = pow(M, v, n);
		
		long ret = 0;
		outer:
		for(int j = 0;j < 64;j++){
			for(int i = 0;i < 6;i++){
				if(i < 3){
					int q = 9<<i;
					if((j&q) == 0)continue outer;
				}
				if(i % 3 != 2){
					int q = 3<<i;
					if((j&q) == 0)continue outer;
				}
			}
			ret += v[j];
		}
		out.println(ret%mod);
	}

	
	
	
	
	void dfs(int ni, int pos, int[] can, int[][] M, int from)
	{
		if(pos == can.length){
			for(int i = 3;i < 9;i++){
				if(i < 6){
					int q = 9<<i;
					if((ni&q) == 0)return;
				}
				if(i % 3 != 2){
					int q = 3<<i;
					if((ni&q) == 0)return;
				}
			}
			M[ni&63][from]++;
			return;
		}
		
		if((can[pos]&ni) == 0){
			dfs(ni|can[pos], pos+1, can, M, from);
		}
		dfs(ni, pos+1, can, M, from);
	}
	
	///////// begin
	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 N621().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

結果

テストケース

ソースコード