結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | neko_the_shadow |
提出日時 | 2021-04-14 00:59:50 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,492 ms / 2,000 ms |
コード長 | 5,983 bytes |
コンパイル時間 | 2,420 ms |
コンパイル使用メモリ | 91,984 KB |
実行使用メモリ | 90,692 KB |
最終ジャッジ日時 | 2023-09-12 15:23:23 |
合計ジャッジ時間 | 39,892 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
51,344 KB |
testcase_01 | AC | 63 ms
51,188 KB |
testcase_02 | AC | 1,039 ms
86,576 KB |
testcase_03 | AC | 833 ms
77,668 KB |
testcase_04 | AC | 858 ms
75,092 KB |
testcase_05 | AC | 485 ms
62,216 KB |
testcase_06 | AC | 984 ms
77,112 KB |
testcase_07 | AC | 1,164 ms
90,692 KB |
testcase_08 | AC | 1,492 ms
89,964 KB |
testcase_09 | AC | 1,030 ms
89,820 KB |
testcase_10 | AC | 590 ms
67,580 KB |
testcase_11 | AC | 590 ms
66,024 KB |
testcase_12 | AC | 547 ms
66,152 KB |
testcase_13 | AC | 447 ms
64,028 KB |
testcase_14 | AC | 414 ms
61,820 KB |
testcase_15 | AC | 558 ms
66,228 KB |
testcase_16 | AC | 545 ms
66,580 KB |
testcase_17 | AC | 204 ms
58,900 KB |
testcase_18 | AC | 246 ms
59,576 KB |
testcase_19 | AC | 590 ms
67,136 KB |
testcase_20 | AC | 819 ms
77,056 KB |
testcase_21 | AC | 831 ms
71,312 KB |
testcase_22 | AC | 680 ms
77,168 KB |
testcase_23 | AC | 600 ms
76,368 KB |
testcase_24 | AC | 585 ms
76,932 KB |
testcase_25 | AC | 1,298 ms
78,144 KB |
testcase_26 | AC | 1,258 ms
77,832 KB |
testcase_27 | AC | 573 ms
62,164 KB |
testcase_28 | AC | 1,268 ms
88,300 KB |
testcase_29 | AC | 831 ms
72,536 KB |
testcase_30 | AC | 1,026 ms
75,080 KB |
testcase_31 | AC | 882 ms
86,212 KB |
testcase_32 | AC | 832 ms
78,496 KB |
testcase_33 | AC | 817 ms
77,644 KB |
testcase_34 | AC | 564 ms
66,452 KB |
testcase_35 | AC | 505 ms
64,012 KB |
testcase_36 | AC | 720 ms
66,792 KB |
testcase_37 | AC | 936 ms
76,284 KB |
testcase_38 | AC | 339 ms
62,100 KB |
testcase_39 | AC | 541 ms
66,668 KB |
testcase_40 | AC | 535 ms
66,412 KB |
testcase_41 | AC | 516 ms
66,548 KB |
testcase_42 | AC | 523 ms
66,272 KB |
testcase_43 | AC | 643 ms
77,504 KB |
testcase_44 | AC | 701 ms
76,656 KB |
testcase_45 | AC | 662 ms
77,400 KB |
testcase_46 | AC | 761 ms
74,860 KB |
testcase_47 | AC | 835 ms
76,828 KB |
testcase_48 | AC | 829 ms
77,088 KB |
ソースコード
package _1473; import java.io.BufferedReader; import java.io.EOFException; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.PrintStream; import java.io.PrintWriter; import java.io.UncheckedIOException; import java.math.BigInteger; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Deque; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.function.Supplier; import java.util.regex.Pattern; public class Main { public void exec() { int n = stdin.nextInt(); int m = stdin.nextInt(); Map<Integer, List<Edge>> edges = new HashMap<>(); for (int i = 0; i < m; i++) { int s = stdin.nextInt()-1; int t = stdin.nextInt()-1; int d = stdin.nextInt(); edges.computeIfAbsent(s, unused -> new ArrayList<>()).add(new Edge(t, d)); edges.computeIfAbsent(t, unused -> new ArrayList<>()).add(new Edge(s, d)); } int ok = 0; int ng = 1000000000+1; int ans = 0; while (Math.abs(ok-ng)>1) { int mi = (ok+ng)/2; Deque<Integer> stack = new ArrayDeque<>(); int[] count = new int[n]; stack.add(0); Arrays.fill(count, Integer.MAX_VALUE); count[0]=0; while (!stack.isEmpty()) { int cur = stack.pop(); for (Edge e : edges.get(cur)) { if (mi <= e.d && count[cur]+1 < count[e.next]) { stack.add(e.next); count[e.next] = count[cur]+1; } } } if (count[n-1]!=Integer.MAX_VALUE) { ok = mi; ans = count[n-1]; } else { ng = mi; } } stdout.println(ok, ans); } public class Edge { public int next; public int d; public Edge(int next, int d) { super(); this.next = next; this.d = d; } } private static final Stdin stdin = new Stdin(System.in); private static final Stdout stdout = new Stdout(System.out); public static void main(String[] args) { try { new Main().exec(); } finally { stdout.flush(); } } public static class Stdin { private Deque<String> queue; private BufferedReader in; private Pattern space; public Stdin(InputStream in) { this.queue = new ArrayDeque<>(); this.in = new BufferedReader(new InputStreamReader(in)); this.space = Pattern.compile(" "); } public String nextString() { if (queue.isEmpty()) { try { String line = in.readLine(); if (line == null) { throw new EOFException(); } space.splitAsStream(line).forEach(this.queue::addLast); } catch (IOException e) { throw new UncheckedIOException(e); } } return queue.removeFirst(); } public int nextInt() { return Integer.parseInt(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public BigInteger nextBigInteger() { return new BigInteger(nextString()); } public String[] nextStringArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = nextString(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public double[] nextDoubleArray(int n) { double[] a = new double[n]; for (int i = 0; i < n; i++) a[i] = nextDouble(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public BigInteger[] nexBigIntegerArray(int n) { BigInteger[] a = new BigInteger[n]; for (int i = 0; i < n; i++) a[i] = nextBigInteger(); return a; } public List<Integer> nextIntegerList(int n) { return nextList(n, this::nextInt); } public List<Long> nextLongList(int n) { return nextList(n, this::nextLong); } public List<Double> nextDoubleList(int n) { return nextList(n, this::nextDouble); } public List<String> nextStringList(int n) { return nextList(n, this::nextString); } public List<BigInteger> nextBigIntegerList(int n) { return nextList(n, this::nextBigInteger); } private <T> List<T> nextList(int n, Supplier<T> supplier) { List<T> a = new ArrayList<>(); for (int i = 0; i < n; i++) a.add(supplier.get()); return a; } } public static class Stdout { private PrintWriter stdout; public Stdout(PrintStream stdout) { this.stdout = new PrintWriter(stdout, false); } public void println(Object ... objs) { for (int i = 0, len = objs.length; i < len; i++) { stdout.print(objs[i]); if (i != len-1) stdout.print(' '); } stdout.println(); } public void flush() { stdout.flush(); } } }