結果

問題 No.1473 おでぶなおばけさん
ユーザー neko_the_shadow
提出日時 2021-04-14 00:51:14
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,957 ms / 2,000 ms
コード長 6,386 bytes
コンパイル時間 2,636 ms
コンパイル使用メモリ 93,536 KB
実行使用メモリ 106,476 KB
最終ジャッジ日時 2024-06-30 03:18:21
合計ジャッジ時間 49,261 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff # 

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.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
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<int[]>> nexts = new HashMap<>();
        for (int i = 0; i < m; i++) {
            int s = stdin.nextInt();
            int t = stdin.nextInt();
            int d = stdin.nextInt();
            nexts.computeIfAbsent(s, unused -> new ArrayList<>()).add(new int[] {t, d});
            nexts.computeIfAbsent(t, unused -> new ArrayList<>()).add(new int[] {s, d});
        }
        
        int ok = 0;
        int ng = 1000000000+1;
        while (Math.abs(ok-ng)>1) {
            int mi = (ok+ng)/2;

            
            Deque<Integer> stack = new ArrayDeque<>();
            Set<Integer> visited = new HashSet<>();
            stack.add(1);
            visited.add(1);
            while (!stack.isEmpty()) {
                int cur = stack.pop();
                for (int[] next : nexts.get(cur)) {
                    int nxt = next[0];
                    int d = next[1];
                    if (visited.contains(nxt)) continue;
                    if (mi <= d) {
                        stack.add(nxt);
                        visited.add(nxt);
                    }
                }
            }
            if (visited.contains(n)) {
                ok = mi;
            } else {
                ng = mi;
            }
        }
        
        
        Map<Integer, Integer> score = new HashMap<>();
        Deque<Integer> stack = new ArrayDeque<>();
        score.put(1, 0);
        stack.add(1);
        while (!stack.isEmpty()) {
            int cur = stack.pop();
            for (int[] next : nexts.get(cur)) {
                int nxt = next[0];
                int d = next[1];
                if (ok <= d && score.get(cur) + 1 < score.getOrDefault(nxt, Integer.MAX_VALUE)) {
                    score.put(nxt, score.get(cur)+1);
                    stack.add(nxt);
                }
            }
        }
        
        stdout.println(ok, score.get(n));
    }
    

    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();
        }
    }
}
0