백준_17472_다리 만들기 2 (mst&bfs)
Algorithm/Algorithm 문제2024. 3. 2. 23:25백준_17472_다리 만들기 2 (mst&bfs)

자력으로 풀어내서 매우 뿌듯ㅋ import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Comparator; import java.util.LinkedList; import java.util.PriorityQueue; import java.util.Queue; import java.util.StringTokenizer; public class BJ_17472_다리만들기2 { static int[] dx = {0, 0, -1, 1}; //상하좌우 static int[] dy = {-1, 1, 0, 0}; static int[] parent; static int[][] ..

백준_1197_최소스패닝트리 (mst)
Algorithm/Algorithm 문제2024. 3. 2. 23:20백준_1197_최소스패닝트리 (mst)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Comparator; import java.util.PriorityQueue; import java.util.StringTokenizer; public class BJ_1197_최소스패닝트리 { static int[] parent; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new..

백준_1389 케빈 베이컨의 6단계 법칙 (플로이드-워셜)
Algorithm/Algorithm 문제2024. 2. 29. 11:04백준_1389 케빈 베이컨의 6단계 법칙 (플로이드-워셜)

양방향 엣지여야함을 주의 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_1389_케빈베이컨의6단계법칙 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine(), " "); int n = Integer.parseInt(s..

백준_11403 경로 찾기 (플로이드-워셜)
Algorithm/Algorithm 문제2024. 2. 28. 15:32백준_11403 경로 찾기 (플로이드-워셜)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_11403_경로찾기 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[][] distance = new int[n][n]; int i, j; StringTokenizer st; for..

백준_11404 플로이드 (플로이드-워셜)
Algorithm/Algorithm 문제2024. 2. 27. 11:38백준_11404 플로이드 (플로이드-워셜)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_11404_플로이드 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int m = Integer.parseInt(br.readLine()); int[][] distance = new int..

백준_1219 오민식의 고민 (벨만-포드)
Algorithm/Algorithm 문제2024. 2. 26. 11:58백준_1219 오민식의 고민 (벨만-포드)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class BJ_1219_오민식의고민 { static long[] mMoney; static int[] cMoney; static Edge[] edges; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st..

백준_11657 타임머신 (벨만-포드)
Algorithm/Algorithm 문제2024. 2. 25. 23:20백준_11657 타임머신 (벨만-포드)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_11657_타임머신 { static long[] distance; static Edge[] edges; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine(), " "); i..

백준_1854 k번째 최단경로 찾기 (다익스트라)
Algorithm/Algorithm 문제2024. 2. 24. 23:03백준_1854 k번째 최단경로 찾기 (다익스트라)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Comparator; import java.util.PriorityQueue; import java.util.StringTokenizer; public class BJ_1854_k번째최단경로찾기 { static ArrayList[] arr; static PriorityQueue[] distance; static int k; public static void main(String[] args) throws IOException { BufferedReader br ..

백준_1916 최소비용 구하기 (다익스트라)
Algorithm/Algorithm 문제2024. 2. 23. 21:27백준_1916 최소비용 구하기 (다익스트라)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Comparator; import java.util.PriorityQueue; import java.util.Queue; import java.util.StringTokenizer; public class BJ_1916_최소비용구하기 { static ArrayList[] arr; static boolean[] visited; static int[] distance; public static void main(String[] args) throws IOExcept..

백준_1753 최단경로 (다익스트라)
Algorithm/Algorithm 문제2024. 2. 22. 11:12백준_1753 최단경로 (다익스트라)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Comparator; import java.util.PriorityQueue; import java.util.Queue; import java.util.StringTokenizer; public class BJ_1753_최단경로 { static ArrayList[] arr; static boolean[] visited; static int[] distance; static Queue queue; public static void main(String[] args..

image