結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
コンテスト
ユーザー nishi5451
提出日時 2021-11-25 19:09:55
言語 Java
(openjdk 23)
結果
AC  
実行時間 603 ms / 2,000 ms
コード長 3,253 bytes
コンパイル時間 2,471 ms
コンパイル使用メモリ 78,288 KB
実行使用メモリ 43,144 KB
最終ジャッジ日時 2024-06-28 12:02:27
合計ジャッジ時間 11,954 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.util.stream.*;
import java.io.*;

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	static int n;
	static long[][] mul(long[][] a, long[][] b){
		long[][] ret = new long[n][n];
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				for(int k = 0; k < n; k++){
					ret[i][j] += a[i][k] * b[k][j];
					ret[i][j] %= MOD2;
				}
			}
		}
		return ret;
	}
	static long[][] modPow(long[][] a, long k){
		long[][] ret = new long[n][n];
		for(int i = 0; i < n; i++) ret[i][i] = 1;
		while(k > 0){ 
			if((k & 1) == 1){
				ret = mul(ret, a);
			}
			a = mul(a, a);
			k >>= 1;
		}
		return ret;
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		n = fs.nextInt();
		int m = fs.nextInt();
		long t = fs.nextLong();
		long[][] dp = new long[n][n];
		for(int i = 0; i < m; i++){
			int a = fs.nextInt();
			int b = fs.nextInt();
			dp[a][b] = 1;
			dp[b][a] = 1;
		}
		dp = modPow(dp, t);
		pw.println(dp[0][0]);
		/*
		[ndp0    [0 1 1    [dp0
		 ndp1  =  1 0 1  *  dp1
		 ndp2]    1 1 0]    dp2]
		*/

	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0