#211151 (Java21) No.578 3 x N グリッド上のサイクルのサイズ(easy)

提出ソース

結果

問題	No.578 3 x N グリッド上のサイクルのサイズ(easy)
ユーザー	37zigen
提出日時	2017-10-22 20:25:44
言語	Java21 (openjdk 21)
結果	AC
実行時間	54 ms / 2,000 ms
コード長	4,676 bytes
コンパイル時間	2,532 ms
コンパイル使用メモリ	78,536 KB
実行使用メモリ	37,120 KB
最終ジャッジ日時	2024-05-01 10:21:36
合計ジャッジ時間	6,059 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	48 ms 36,992 KB
testcase_01	AC	51 ms 36,388 KB
testcase_02	AC	48 ms 36,776 KB
testcase_03	AC	49 ms 36,556 KB
testcase_04	AC	48 ms 36,956 KB
testcase_05	AC	48 ms 36,992 KB
testcase_06	AC	48 ms 36,660 KB
testcase_07	AC	48 ms 36,848 KB
testcase_08	AC	48 ms 36,936 KB
testcase_09	AC	48 ms 36,856 KB
testcase_10	AC	51 ms 37,040 KB
testcase_11	AC	51 ms 36,904 KB
testcase_12	AC	52 ms 36,932 KB
testcase_13	AC	53 ms 37,120 KB
testcase_14	AC	50 ms 36,632 KB
testcase_15	AC	52 ms 36,732 KB
testcase_16	AC	50 ms 36,972 KB
testcase_17	AC	54 ms 36,968 KB
testcase_18	AC	50 ms 36,680 KB
testcase_19	AC	50 ms 36,700 KB
testcase_20	AC	52 ms 36,516 KB
testcase_21	AC	50 ms 36,752 KB
testcase_22	AC	48 ms 36,952 KB
testcase_23	AC	51 ms 36,564 KB
testcase_24	AC	48 ms 37,020 KB
testcase_25	AC	51 ms 36,728 KB
testcase_26	AC	49 ms 36,564 KB
testcase_27	AC	50 ms 36,912 KB
testcase_28	AC	49 ms 36,684 KB
testcase_29	AC	50 ms 36,396 KB
testcase_30	AC	48 ms 36,940 KB
testcase_31	AC	49 ms 37,040 KB
testcase_32	AC	49 ms 36,772 KB
testcase_33	AC	51 ms 36,664 KB
testcase_34	AC	50 ms 36,988 KB
testcase_35	AC	51 ms 36,412 KB
testcase_36	AC	54 ms 36,856 KB
testcase_37	AC	53 ms 36,992 KB
testcase_38	AC	50 ms 36,716 KB
testcase_39	AC	49 ms 36,832 KB
testcase_40	AC	49 ms 36,760 KB
testcase_41	AC	53 ms 36,904 KB
testcase_42	AC	52 ms 37,084 KB
testcase_43	AC	52 ms 36,908 KB
testcase_44	AC	51 ms 36,776 KB
testcase_45	AC	50 ms 36,552 KB
testcase_46	AC	50 ms 36,832 KB
testcase_47	AC	50 ms 36,704 KB
testcase_48	AC	51 ms 36,772 KB
testcase_49	AC	51 ms 36,624 KB

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

ソースコード

raw source code

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		// long t = System.currentTimeMillis();
		new Main().run();
		// System.err.println(System.currentTimeMillis() - t);
	}

	final long MOD = 1_000_000_000 + 7;

	void run() {
		Scanner sc = new Scanner();
		long n = sc.nextLong();
		String[] s = new String[] { "0000000000", "0034534306", "1023400005", "2032334000", "3043243450", "1003423000",
				"2004332300", "1000403205", "2030000340", "0000300004" };
		long[][] B = new long[10][10];
		long[][] A = new long[10][10];
		for (int i = 0; i < 10; ++i) {
			for (int j = 0; j < 10; ++j) {
				B[i][j] = (int) (s[i].charAt(j) - '0');
				if (B[i][j] > 0)
					++A[i][j];
			}
		}
		++A[0][0];
		++A[1][1];

		long[][] mat = new long[20][20];
		long[][] mat2 = new long[20][10];
		long[][] mat3 = new long[10][10];
		for (int i = 0; i < 10; ++i) {
			mat2[i][i] = 1;
			for (int j = 0; j < 10; ++j) {
				mat[i][j] = A[i][j];
				mat[i + 10][j + 10] = A[i][j];
				mat[i + 10][j] = B[i][j];
			}
		}
		mat = pow(mat, n + 1);
		mat = mul(mat, mat2);

		for (int i = 0; i < 10; ++i) {
			for (int j = 0; j < 10; ++j) {
				mat3[i][j] = mat[i + 10][j];
			}
		}

		long[][] v = new long[10][1];
		v[0][0] = 1;
		v = mul(mat3, v);
		System.out.println(v[1][0]);
	}

	long[][] pow(long[][] a, long n) {
		long[][] ret = new long[a.length][a.length];
		for (int i = 0; i < ret.length; ++i)
			ret[i][i] = 1;
		long[][] p = new long[a.length][a.length];
		for (int i = 0; i < a.length; ++i) {
			for (int j = 0; j < a[i].length; ++j) {
				p[i][j] = a[i][j];
			}
		}
		for (; n > 0; n >>= 1, p = mul(p, p)) {
			if (n % 2 == 1)
				ret = mul(ret, p);
		}
		return ret;
	}

	long[][] mul(long[][] a, long[][] b) {
		long[][] ret = new long[a.length][b[0].length];
		for (int i = 0; i < a.length; ++i) {
			for (int j = 0; j < b[i].length; ++j) {
				for (int k = 0; k < a[i].length; ++k) {
					ret[i][j] = (ret[i][j] + a[i][k] * b[k][j] % MOD) % MOD;
				}
			}
		}
		return ret;
	}

	long[][] add(long[][] a, long[][] b) {
		if (a.length != b.length || a[0].length != b[0].length)
			throw new AssertionError();
		long[][] ret = new long[a.length][a[0].length];
		for (int i = 0; i < a.length; ++i) {
			for (int j = 0; j < a[i].length; ++j) {
				ret[i][j] = (a[i][j] + b[i][j]) % MOD;
			}
		}
		return ret;
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

	class Scanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[ptr++];
			else
				return -1;
		}

		private boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}

		private void skipUnprintable() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr]))
				ptr++;
		}

		public boolean hasNext() {
			skipUnprintable();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}
	}
}

yukicoder

結果

テストケース

ソースコード