Merge pull request #63 from kohtaewoo/feat/boj-Oct

feat(Taewoo): add/Baekjoon-1167, Baekjoon-1260, Baekjoon-2178

Author: kohtaewoo

Taewoo/Oct/Baekjoon-1167.java

@@ -0,0 +1,47 @@
+package Baekjoon;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+	static int N;
+	static ArrayList<int[]>[] graph;
+	static boolean[] vistied;
+
+	public static void main(String[] args) throws IOException {
+		st = new StringTokenizer(br.readLine());
+		N = Integer.valueOf(st.nextToken());
+
+		graph = new ArrayList[N + 1];
+		for (int i = 1; i <= N; i++) {
+			graph[i] = new ArrayList<>();
+		}
+
+		int u, v;
+		int value;
+		for (int i = 1; i <= N; i++) {
+			st = new StringTokenizer(br.readLine());
+			u = Integer.valueOf(st.nextToken());
+			value = Integer.valueOf(st.nextToken());
+			v = Integer.valueOf(st.nextToken());
+
+			graph[u].add(new int[] { v, value });
+		}
+	}
+
+	public static void bfs(int node) {
+		Deque<Integer> queue = new ArrayDeque<>();
+		queue.add(node);
+		while (!queue.isEmpty()) {
+			int next_node = queue.poll();
+			for (int[] neighbor : graph[next_node]) {
+				int neighbor_node = neighbor[0];
+				queue.add(neighbor_node);
+				
+			}
+		}
+	}
+}

Taewoo/Oct/Baekjoon-1260.java

@@ -0,0 +1,72 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+	static ArrayList<Integer>[] graph;
+	static boolean[] visited;
+
+	public static void main(String[] args) throws IOException {
+		st = new StringTokenizer(br.readLine());
+		int N = Integer.valueOf(st.nextToken());
+		int M = Integer.valueOf(st.nextToken());
+		int V = Integer.valueOf(st.nextToken());
+
+		graph = new ArrayList[N + 1];
+		for (int i = 1; i <= N; i++) {
+			graph[i] = new ArrayList<>();
+		}
+		visited = new boolean[N + 1];
+
+		int u;
+		int v;
+		for (int i = 1; i <= M; i++) {
+			st = new StringTokenizer(br.readLine());
+			u = Integer.valueOf(st.nextToken());
+			v = Integer.valueOf(st.nextToken());
+			graph[u].add(v);
+			graph[v].add(u);
+		}
+
+		for (int i = 1; i <= N; i++) {
+			Collections.sort(graph[i]);
+		}
+
+		dfs(V);
+
+		visited = new boolean[N + 1];
+		Deque<Integer> queue = new ArrayDeque<>();
+		queue.add(V);
+		visited[V] = true;
+
+		bw.write("\n");
+
+		int node;
+		while (!queue.isEmpty()) {
+			node = queue.poll();
+			bw.write(String.valueOf(node) + " ");
+			for (int neighbor : graph[node]) {
+				if (!visited[neighbor]) {
+					visited[neighbor] = true;
+					queue.add(neighbor);
+				}
+			}
+		}
+
+		bw.close();
+
+	}
+
+	public static void dfs(int node) throws IOException {
+		visited[node] = true;
+		bw.write(String.valueOf(node) + " ");
+
+		for (int neighbor : graph[node]) {
+			if (!visited[neighbor]) {
+				dfs(neighbor);
+			}
+		}
+	}
+}

Taewoo/Oct/Baekjoon-2178.java

@@ -0,0 +1,61 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+	static int[][] distance;
+	static int N;
+	static int M;
+	static int[][] maze;
+	static int[] dx = { 0, 0, 1, -1 };
+	static int[] dy = { 1, -1, 0, 0 };
+
+	public static void main(String[] args) throws IOException {
+		st = new StringTokenizer(br.readLine());
+		N = Integer.valueOf(st.nextToken());
+		M = Integer.valueOf(st.nextToken());
+		maze = new int[N][M];
+		distance = new int[N][M];
+
+		for (int i = 0; i < N; i++) {
+			String line = br.readLine();
+			for (int j = 0; j < M; j++) {
+				maze[i][j] = line.charAt(j) - '0';
+			}
+		}
+
+		bfs(0, 0);
+		bw.write(String.valueOf(distance[N - 1][M - 1]));
+		bw.close();
+	}
+
+	public static void bfs(int x, int y) {
+		Deque<int[]> queue = new ArrayDeque<>();
+		queue.add(new int[] { x, y });
+		distance[x][y] = 1;
+
+		while (!queue.isEmpty()) {
+			int current_x = queue.getFirst()[0];
+			int current_y = queue.getFirst()[1];
+			queue.poll();
+
+			for (int i = 0; i < 4; i++) {
+				int next_x = current_x + dx[i];
+				int next_y = current_y + dy[i];
+
+				if (next_x < 0 || next_y < 0 || next_x >= N || next_y >= M) {
+					continue;
+				}
+
+				if (maze[next_x][next_y] == 0 || distance[next_x][next_y] != 0) {
+					continue;
+				}
+
+				queue.add(new int[] { next_x, next_y });
+				distance[next_x][next_y] = distance[current_x][current_y] + 1;
+			}
+		}
+	}
+}