import java.io.*; import java.util.*; public class Main { static int n, m, start, end; static List> list = new ArrayList<>(); public static void main(String[] args) throws IOException { read(); solve(); } private static void read() throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); n = Integer.parseInt(st.nextToken()); m = Integer.parseInt(st.nextToken()); for(int i=0; i()); } for(int i=0; i map = list.get(y); map.put(x, Math.max(map.getOrDefault(x, 0), w)); map = list.get(x); map.put(y, Math.max(map.getOrDefault(y, 0), w)); } st = new StringTokenizer(br.readLine()); start = Integer.parseInt(st.nextToken()) - 1; end = Integer.parseInt(st.nextToken()) - 1; } private static void solve() { boolean[] visited = new boolean[n]; int[] weight = new int[n]; weight[start] = 1_000_000_000; Queue q = new ArrayDeque<>(); q.add(start); while(!q.isEmpty()) { int cur = q.poll(); int value = weight[cur]; visited[cur] = true; HashMap map = list.get(cur); for(int key : map.keySet()) { if(visited[key]) continue; int w = Math.min(map.get(key), value); if(w > weight[key]) weight[key] = w; if(key != end) q.add(key); } } System.out.println(weight[end]); } }

제출 #112464

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: