백준
-
boj)2644 - 촌수계산PS/boj 2020. 9. 5. 16:40
import java.io.*; import java.util.*; public class Main { static int N, M, person1, person2, x, y; static LinkedList[] nodeList; static boolean[] visited; static boolean check; static class Node { int index; int distance; public Node(int index, int distance) { this.index = index; this.distance = distance; } } public static void bfs(int start, int end) { Queue q = new LinkedList(); q.offer(new No..
-
boj)7576 - 토마토PS/boj 2020. 9. 5. 14:30
import java.io.*; import java.util.*; public class Main { static int N, M; static int[][] graph; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; // x,y 좌표가 함께 움직야하고, 날짜를 세야하는데 그걸 클래스 안에 넣었음 static class Dot { int x; int y; int day; public Dot(int x, int y, int day) { this.x = x; this.y = y; this.day = day; } } public static void main(String[] args) throws IOException { input();..
-
boj)2178 - 미로 탐색PS/boj 2020. 9. 3. 18:20
import java.io.*; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; class Node { int index; int distance; public Node(int index, int distance) { this.index = index; this.distance = distance; } public int getIndex() { return index; } public int getDistance() { return distance; } } public class Main { static int n, m, nx, ny; static int[][] graph = new int[101]..
-
boj)1012 - 유기농 배추PS/boj 2020. 9. 3. 17:00
import java.io.*; import java.util.StringTokenizer; public class Main { static int t, m, n, k, x, y, ans; static int[][] graph = new int[50][50]; public static boolean dfs(int x, int y) { if (x = m || y = n) { return false; } if (graph[x][y] == 1) { graph[x][y] = 0; dfs(x - 1, y); dfs(x + 1, y); dfs(x, y - 1); dfs(x, y + 1); return true; } return false; } public static void m..
-
boj)2667 - 단지번호붙이기PS/boj 2020. 9. 3. 16:02
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, danjiCnt; static int[][] graph = new int[26][26]; static int[] num = new int[26*26]; static boolean dfs (int x, int y) { if (x n || y n) { return false; } // 단지가 될 수 있다면 if (graph[x][y] == 1) { graph[x][y] = 0; num[danjiCnt]++; d..
-
boj)2606 - 바이러스PS/boj 2020. 9. 3. 13:05
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, m, node1, node2, cnt; static LinkedList[] nodeList; static boolean[] visited = new boolean[101]; public static void dfs(int node) { if (visited[node]) return; visited[node] = true; cnt++; for (int nextNode : nodeList[node]) { dfs(nextNode); } } public..
-
boj)1260 - DFS와 BFSPS/boj 2020. 9. 3. 12:25
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, m, v; static LinkedList[] nodeList; static boolean[] checked = new boolean[1001]; static boolean[] checked2 = new boolean[1001]; public static void dfs(int node) { if (checked[node]) return; checked[node] = true; System.out.print(node + " "); for (int..
-
boj)18352 - 특정 거리의 도시 찾기PS/boj 2020. 9. 2. 17:39
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { public static int n, m, k, x; public static ArrayList graph = new ArrayList(); // 모든 도시에 대한 최단 거리 초기화 public static int[] d = new int[300001]; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(S..