結果

問題 No.92 逃走経路
ユーザー uwiuwi
提出日時 2014-12-07 19:21:37
言語 Java21
(openjdk 21)
結果
AC  
実行時間 360 ms / 5,000 ms
コード長 5,066 bytes
コンパイル時間 2,196 ms
コンパイル使用メモリ 80,684 KB
実行使用メモリ 54,504 KB
最終ジャッジ日時 2024-06-11 16:07:38
合計ジャッジ時間 6,457 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 262 ms
54,504 KB
testcase_01 AC 59 ms
50,712 KB
testcase_02 AC 63 ms
50,916 KB
testcase_03 AC 72 ms
50,788 KB
testcase_04 AC 62 ms
50,940 KB
testcase_05 AC 130 ms
53,204 KB
testcase_06 AC 118 ms
53,036 KB
testcase_07 AC 124 ms
53,116 KB
testcase_08 AC 145 ms
52,664 KB
testcase_09 AC 138 ms
52,576 KB
testcase_10 AC 360 ms
53,804 KB
testcase_11 AC 264 ms
54,036 KB
testcase_12 AC 319 ms
54,036 KB
testcase_13 AC 138 ms
52,820 KB
testcase_14 AC 184 ms
53,168 KB
testcase_15 AC 196 ms
53,748 KB
testcase_16 AC 208 ms
54,448 KB
testcase_17 AC 214 ms
53,680 KB
testcase_18 AC 192 ms
53,912 KB
testcase_19 AC 123 ms
53,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), m = ni(), K = ni();
		int[] from = new int[m];
		int[] to = new int[m];
		int[] w = new int[m];
		for(int i = 0;i < m;i++){
			from[i] = ni()-1;
			to[i] = ni()-1;
			w[i] = ni();
		}
		int[][][] g = packWU(n, from, to, w);
		int[] d = na(K);
		boolean[][] pre = new boolean[n][n]; // start cur
		boolean[][] cur = new boolean[n][n]; // start cur
		for(int i = 0;i < n;i++){
			pre[i][i] = true;
		}
		for(int z = K-1;z >= 0;z--){
			for(int i = 0;i < n;i++){
				Arrays.fill(cur[i], false);
			}
			for(int i = 0;i < n;i++){
				for(int j = 0;j < n;j++){
					if(pre[i][j]){
						for(int[] e : g[j]){
							if(e[1] == d[z]){
								cur[i][e[0]] = true;
							}
						}
					}
				}
			}
			boolean[][] dum = pre; pre = cur; cur = dum;
		}
		int ct = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				if(pre[i][j]){
					ct++;
					break;
				}
			}
		}
		out.println(ct);
		boolean fi = true;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				if(pre[i][j]){
					if(!fi)out.print(" ");
					fi = false;
					out.print(i+1);
					break;
				}
			}
		}
		out.println();
	}
	
	public static int[][][] packWU(int n, int[] from, int[] to, int[] w) {
		int[][][] g = new int[n][][];
		int[] p = new int[n];
		for (int f : from)
			p[f]++;
		for (int t : to)
			p[t]++;
		for (int i = 0; i < n; i++)
			g[i] = new int[p[i]][2];
		for (int i = 0; i < from.length; i++) {
			--p[from[i]];
			g[from[i]][p[from[i]]][0] = to[i];
			g[from[i]][p[from[i]]][1] = w[i];
			--p[to[i]];
			g[to[i]][p[to[i]]][0] = from[i];
			g[to[i]][p[to[i]]][1] = w[i];
		}
		return g;
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private static char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private static char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0