結果
問題 | No.1750 ラムドスウイルスの感染拡大-hard |
ユーザー | nishi5451 |
提出日時 | 2021-11-25 19:09:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 583 ms / 2,000 ms |
コード長 | 3,253 bytes |
コンパイル時間 | 2,185 ms |
コンパイル使用メモリ | 74,972 KB |
実行使用メモリ | 54,548 KB |
最終ジャッジ日時 | 2023-09-10 20:56:45 |
合計ジャッジ時間 | 11,150 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,436 KB |
testcase_01 | AC | 42 ms
49,780 KB |
testcase_02 | AC | 42 ms
49,232 KB |
testcase_03 | AC | 42 ms
49,372 KB |
testcase_04 | AC | 87 ms
51,736 KB |
testcase_05 | AC | 42 ms
49,328 KB |
testcase_06 | AC | 42 ms
49,432 KB |
testcase_07 | AC | 42 ms
49,208 KB |
testcase_08 | AC | 166 ms
51,596 KB |
testcase_09 | AC | 166 ms
51,708 KB |
testcase_10 | AC | 170 ms
51,776 KB |
testcase_11 | AC | 150 ms
51,604 KB |
testcase_12 | AC | 176 ms
51,752 KB |
testcase_13 | AC | 171 ms
51,732 KB |
testcase_14 | AC | 548 ms
54,080 KB |
testcase_15 | AC | 558 ms
54,000 KB |
testcase_16 | AC | 568 ms
54,108 KB |
testcase_17 | AC | 570 ms
54,524 KB |
testcase_18 | AC | 583 ms
54,008 KB |
testcase_19 | AC | 562 ms
54,192 KB |
testcase_20 | AC | 421 ms
54,548 KB |
testcase_21 | AC | 469 ms
54,160 KB |
testcase_22 | AC | 140 ms
53,856 KB |
testcase_23 | AC | 534 ms
54,140 KB |
testcase_24 | AC | 124 ms
51,592 KB |
testcase_25 | AC | 199 ms
53,824 KB |
testcase_26 | AC | 130 ms
52,160 KB |
testcase_27 | AC | 51 ms
49,536 KB |
testcase_28 | AC | 76 ms
51,592 KB |
testcase_29 | AC | 52 ms
47,488 KB |
testcase_30 | AC | 140 ms
53,864 KB |
testcase_31 | AC | 138 ms
53,776 KB |
testcase_32 | AC | 134 ms
53,768 KB |
testcase_33 | AC | 133 ms
53,716 KB |
ソースコード
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; } }