結果

問題 No.92 逃走経路
ユーザー crazybbb3
提出日時 2017-01-31 10:10:25
言語 Java
(openjdk 23)
結果
AC  
実行時間 136 ms / 5,000 ms
コード長 2,588 bytes
コンパイル時間 2,565 ms
コンパイル使用メモリ 78,560 KB
実行使用メモリ 40,404 KB
最終ジャッジ日時 2024-12-23 22:09:03
合計ジャッジ時間 5,491 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class Main {
    void solve() throws IOException {
        int n = ni(), m = ni(), k = ni();
        int[] a = new int[m];
        int[] b = new int[m];
        int[] c = new int[m];
        for (int i = 0; i < m; i++) {
            a[i] = ni() - 1;
            b[i] = ni() - 1;
            c[i] = ni();
        }
        int[] d = nia(k);
        boolean[] can = new boolean[n];
        Arrays.fill(can, true);
        for (int i = 0; i < k; i++) {
            boolean[] next = new boolean[n];
            for (int j = 0; j < m; j++) {
                if (c[j] == d[i]) {
                    if (can[a[j]]) next[b[j]] = true;
                    if (can[b[j]]) next[a[j]] = true;
                }
            }
            can = next;
        }
        ArrayList<Integer> ans = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            if (can[i]) ans.add(i + 1);
        }
        out.println(ans.size());
        for (int i = 0; i < ans.size(); i++) {
            if (i > 0) out.print(" ");
            out.print(ans.get(i));
        }
        out.println();
    }
    String ns() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine(), " ");
        }
        return tok.nextToken();
    }
    int ni() throws IOException {
        return Integer.parseInt(ns());
    }
    long nl() throws IOException {
        return Long.parseLong(ns());
    }
    double nd() throws IOException {
        return Double.parseDouble(ns());
    }
    String[] nsa(int n) throws IOException {
        String[] res = new String[n];
        for (int i = 0; i < n; i++) {
            res[i] = ns();
        }
        return res;
    }
    int[] nia(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = ni();
        }
        return res;
    }
    long[] nla(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nl();
        }
        return res;
    }
    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;
    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        tok = new StringTokenizer("");
        Main main = new Main();
        main.solve();
        out.close();
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0