結果

問題 No.1112 冥界の音楽
ユーザー 37zigen37zigen
提出日時 2019-11-24 02:41:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 117 ms / 2,000 ms
コード長 3,398 bytes
コンパイル時間 2,375 ms
コンパイル使用メモリ 77,692 KB
実行使用メモリ 39,532 KB
最終ジャッジ日時 2024-04-20 02:10:35
合計ジャッジ時間 5,424 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
36,352 KB
testcase_01 AC 50 ms
36,508 KB
testcase_02 AC 49 ms
36,816 KB
testcase_03 AC 49 ms
36,732 KB
testcase_04 AC 48 ms
36,828 KB
testcase_05 AC 48 ms
36,520 KB
testcase_06 AC 77 ms
37,436 KB
testcase_07 AC 54 ms
36,768 KB
testcase_08 AC 48 ms
36,652 KB
testcase_09 AC 53 ms
36,620 KB
testcase_10 AC 49 ms
36,668 KB
testcase_11 AC 56 ms
36,892 KB
testcase_12 AC 50 ms
36,808 KB
testcase_13 AC 56 ms
36,868 KB
testcase_14 AC 95 ms
38,692 KB
testcase_15 AC 85 ms
38,100 KB
testcase_16 AC 48 ms
37,088 KB
testcase_17 AC 85 ms
37,948 KB
testcase_18 AC 90 ms
37,792 KB
testcase_19 AC 48 ms
36,712 KB
testcase_20 AC 57 ms
36,476 KB
testcase_21 AC 90 ms
38,404 KB
testcase_22 AC 94 ms
38,604 KB
testcase_23 AC 80 ms
37,756 KB
testcase_24 AC 49 ms
36,496 KB
testcase_25 AC 50 ms
36,780 KB
testcase_26 AC 54 ms
36,828 KB
testcase_27 AC 49 ms
36,652 KB
testcase_28 AC 52 ms
36,888 KB
testcase_29 AC 47 ms
36,936 KB
testcase_30 AC 94 ms
38,792 KB
testcase_31 AC 54 ms
36,372 KB
testcase_32 AC 98 ms
38,732 KB
testcase_33 AC 51 ms
36,748 KB
testcase_34 AC 51 ms
36,428 KB
testcase_35 AC 49 ms
36,620 KB
testcase_36 AC 117 ms
39,532 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {

	final long MOD = (long) 1e9 + 7;

	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[0].length; ++j) {
				for (int k = 0; k < a[i].length; ++k) {
					ret[i][j] += a[i][k] * b[k][j] % MOD;
					ret[i][j] %= MOD;
				}
			}
		}
		return ret;
	}

	long[][] pow(long[][] a, long n) {
		long[][] ret = new long[a.length][a.length];
		for (int i = 0; i < a.length; ++i)
			ret[i][i] = 1;
		for (; n > 0; n >>= 1, a = mul(a, a)) {
			if (n % 2 == 1) {
				ret = mul(ret, a);
			}
		}
		return ret;
	}
	
	// O(K^6 log(N))
	void run() {
		FastScanner sc = new FastScanner();
		int K = sc.nextInt();
		int M = sc.nextInt();
		long N = sc.nextLong();
		int[] P = new int[M];
		int[] Q = new int[M];
		int[] R = new int[M];
		long[][] mat = new long[K * K][K * K];
		for (int i = 0; i < M; ++i) {
			P[i] = sc.nextInt() - 1;
			Q[i] = sc.nextInt() - 1;
			R[i] = sc.nextInt() - 1;
			mat[K * R[i] + Q[i]][K * Q[i] + P[i]] = 1;
		}
		long[][] vec = new long[K * K][1];
		for (int i = 0; i < K; ++i) {
			vec[K * i + 0][0] = 1;
		}
		vec = mul(pow(mat, N - 2), vec);
		long ans = 0;
		for (int i = 0; i < K; ++i) {
			ans += vec[K * 0 + i][0];
			ans %= MOD;
		}
		System.out.println(ans);
	}

	public static void main(String[] args) throws FileNotFoundException {
		new Main().run();
	}

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

class FastScanner {
	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 static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		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 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();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}
0