結果
問題 | No.1190 Points |
ユーザー | uwi |
提出日時 | 2020-08-22 15:30:28 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 392 ms / 2,000 ms |
コード長 | 4,543 bytes |
コンパイル時間 | 6,941 ms |
コンパイル使用メモリ | 82,616 KB |
実行使用メモリ | 65,116 KB |
最終ジャッジ日時 | 2023-08-05 12:37:54 |
合計ジャッジ時間 | 12,741 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,364 KB |
testcase_01 | AC | 46 ms
49,404 KB |
testcase_02 | AC | 43 ms
49,372 KB |
testcase_03 | AC | 269 ms
58,456 KB |
testcase_04 | AC | 210 ms
58,524 KB |
testcase_05 | AC | 245 ms
57,944 KB |
testcase_06 | AC | 295 ms
60,484 KB |
testcase_07 | AC | 375 ms
63,736 KB |
testcase_08 | AC | 391 ms
62,872 KB |
testcase_09 | AC | 352 ms
62,412 KB |
testcase_10 | AC | 336 ms
62,528 KB |
testcase_11 | AC | 287 ms
60,892 KB |
testcase_12 | AC | 320 ms
61,988 KB |
testcase_13 | AC | 280 ms
58,244 KB |
testcase_14 | AC | 102 ms
54,740 KB |
testcase_15 | AC | 392 ms
62,624 KB |
testcase_16 | AC | 104 ms
51,988 KB |
testcase_17 | AC | 390 ms
65,116 KB |
testcase_18 | AC | 208 ms
56,468 KB |
testcase_19 | AC | 102 ms
56,492 KB |
testcase_20 | AC | 275 ms
58,896 KB |
testcase_21 | AC | 128 ms
54,736 KB |
testcase_22 | AC | 117 ms
56,816 KB |
testcase_23 | AC | 379 ms
62,636 KB |
testcase_24 | AC | 384 ms
63,348 KB |
testcase_25 | AC | 228 ms
59,968 KB |
testcase_26 | AC | 159 ms
57,492 KB |
testcase_27 | AC | 223 ms
60,376 KB |
ソースコード
package gioku2020day1; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.InputMismatchException; import java.util.List; import java.util.Queue; public class I { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(), P = ni(); int S = ni()-1, G = ni()-1; int[] from = new int[m]; int[] to = new int[m]; for (int i = 0; i < m; i++) { from[i] = ni() - 1; to[i] = ni() - 1; } int[][] g = packU(n, from, to); int[] ds = d(g, S); int[] dg = d(g, G); List<Integer> ret = new ArrayList<>(); outer: for(int i = 0;i < n;i++){ for(int j = 0;j < 2;j++){ for(int k = 0;k < 2;k++){ if(ds[j*n+i] + dg[k*n+i] <= P && (ds[j*n+i] + dg[k*n+i]) % 2 == P % 2){ ret.add(i+1); continue outer; } } } } if(ret.size() == 0){ out.println(-1); return; } out.println(ret.size()); for(int v : ret){ out.println(v); } } int[] d(int[][] g, int S) { int n = g.length; Queue<Integer> q = new ArrayDeque<>(); q.add(S); int[] d = new int[2*n]; Arrays.fill(d, 999999999); d[S] = 0; while(!q.isEmpty()){ int cur = q.poll(); for(int e : g[cur%n]){ int ne = cur < n ? e + n : e; if(d[ne] > d[cur] + 1){ d[ne] = d[cur] + 1; q.add(ne); } } } return d; } static int[][] packU(int n, int[] from, int[] to) { 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]]; for (int i = 0; i < from.length; i++) { g[from[i]][--p[from[i]]] = to[i]; g[to[i]][--p[to[i]]] = from[i]; } return g; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new I().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private 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 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private 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 int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private 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) { System.out.println(Arrays.deepToString(o)); } }