結果

問題 No.1749 ラムドスウイルスの感染拡大
ユーザー AsahiAsahi
提出日時 2023-05-31 19:08:00
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,935 bytes
コンパイル時間 3,511 ms
コンパイル使用メモリ 77,948 KB
実行使用メモリ 62,052 KB
最終ジャッジ日時 2023-08-28 01:37:27
合計ジャッジ時間 6,932 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,372 KB
testcase_01 AC 44 ms
49,316 KB
testcase_02 AC 43 ms
49,368 KB
testcase_03 AC 45 ms
49,012 KB
testcase_04 WA -
testcase_05 AC 44 ms
49,320 KB
testcase_06 AC 46 ms
49,468 KB
testcase_07 AC 48 ms
49,268 KB
testcase_08 AC 47 ms
49,356 KB
testcase_09 AC 47 ms
49,528 KB
testcase_10 AC 91 ms
60,928 KB
testcase_11 AC 94 ms
61,592 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 125 ms
59,776 KB
testcase_20 AC 64 ms
51,632 KB
testcase_21 WA -
testcase_22 AC 43 ms
49,456 KB
testcase_23 AC 46 ms
49,512 KB
testcase_24 AC 47 ms
49,340 KB
testcase_25 AC 98 ms
59,432 KB
testcase_26 AC 92 ms
56,792 KB
testcase_27 AC 67 ms
54,224 KB
testcase_28 WA -
testcase_29 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main{
    void solve(PrintWriter out, In in) {       
        int n = in.nextInt() , m = in.nextInt() , T = in.nextInt();
        ArrayList<ArrayList<Integer>> bridge = new ArrayList<>();
        for(int i = 0 ; i < n ; i ++ ) bridge.add(new ArrayList<>());
        while(m-->0) {
            int s = in.nextInt() , t = in.nextInt();
            bridge.get(s).add(t);
            bridge.get(t).add(s);
        }
        long [][] dp = new long[T+1][n];
        dp[0][0] = 1;
        for(int i = 0 ; i < T ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                for(int next : bridge.get(j)) {
                    dp[i+1][next] += (dp[i][j] % MOD9);
                }
            }
        }
        out.println(dp[T][0]);
    }   
    /* Library */   
    int lower_bound(long [] A , long key) {
        int left = 0;
        int right = A.length;
        while(left < right) {
            int mid = (left + right) / 2;
            if(A[mid] < key) left = mid + 1;
            else right = mid;
        }
        return right;
    }
    /* ------- */
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        In in  = new In();
        new Main().solve(out,in);
        out.flush();
    }
    final long MOD7 = 1000000007; final long MOD9 = 998244353 ;
    final int [] X4 = {0,1,0,-1}; final int [] Y4 = {-1,0,1,0};
    final int [] X8 = {-1,-1,0,1,1,1,0,-1}; final int [] Y8 = {0,1,1,1,0,-1,-1,-1};
    final int Inf = (int)1e9; final long Lnf = (long)1e18;
    final String yes = "Yes"; final String no = "No";
}
/* Class */

/* ----- */
class Pair{
    private int first ;
    private int second;
    Pair(int first,int second) {
        this.first = first;
        this.second = second;
    }
    int first()  { return this.first ; }
    int second() { return this.second; }
    @Override
    public String toString(){ return first()+" = "+second(); }
}
class PairII {
    private int first ;
    private int second ;
    private int third;
    PairII(int first, int second, int third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }
    int first()  { return this.first ; }
    int second() { return this.second; }
    int third()  { return this.third ; }
    @Override
    public String toString(){ return first()+" = "+second()+" = "+third() ; }
}
class In{
    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();
    }
    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();
    }

    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();
        }
    }
    int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
}
0