結果

問題 No.1473 おでぶなおばけさん
コンテスト
ユーザー shojin_pro
提出日時 2021-04-09 23:09:20
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 4,736 bytes
コンパイル時間 2,723 ms
コンパイル使用メモリ 89,004 KB
実行使用メモリ 83,036 KB
最終ジャッジ日時 2024-06-25 06:57:47
合計ジャッジ時間 7,079 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other TLE * 1 -- * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }
    
    static ArrayList<ArrayList<Edge>> G;
    static int key = 0;
    static TreeMap<Integer,Integer> ans = new TreeMap<Integer,Integer>(Comparator.reverseOrder());
    static boolean[] arrived;
    public static void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int E = sc.nextInt();
        G = new ArrayList<>();
        for(int i = 0; i < N; i++){
            G.add(new ArrayList<>());
        }
        arrived = new boolean[N];
        for (int i = 0; i < E; i++) {
            int a = sc.nextInt()-1;
            int b = sc.nextInt()-1;
            int d = sc.nextInt();
            G.get(a).add(new Edge(b,d));
            G.get(b).add(new Edge(a,d));
        }
        arrived[0] = true;
        dfs(0,N-1,(int)1e9,0);
        pw.println(key + " " + ans.get(key));
        pw.flush();
    }
    
    static void dfs(int now, int goal, int max, int cnt){
        if(now == goal){
            if(max < key) return;
            key = max;
            int val = ans.getOrDefault(max,(int)1e9);
            ans.put(max,Math.min(val,cnt));
            return;
        }
        for(Edge e : G.get(now)){
            int next = e.to;
            int m = e.max;
            if(arrived[next] || m < key) continue;
            arrived[next] = true;
            m = Math.min(max,m);
            dfs(next,goal,m,cnt+1);
            arrived[next] = false;
        }
        return;
    }
    
    static class Edge {
        int to, max;
        public Edge(int to, int max) {
            this.to = to;
            this.max = max;
        }
    }
    
    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}



class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        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 long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0