728x90

전체 글 281

73 삐약 : 백준 5279| 계단 오르기 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/2579 package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class BOJ_5279 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] input = new int[n+1]; ..

72 삐약 : 백준 9095| 1,2,3 더하기 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/9095 package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class BOJ_9095 { static int[] dp; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int T = Integer.parseInt(br.readLine()); // test case ..

71 삐약 : 백준 1463| 1로만들기 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/1463  package BKD_0x10_DP;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class BOJ_1463 { static Integer[] dp; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); dp ..

70 삐약 : 백준 4179| 불! [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/4179  package BKD_0x9_BFS;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class BOJ_4179 { static char[][] building; static Queue person; static Queue fire; static int[] dx={1,-1,0,0}; static int[] dy={0,0,1,-1}; pu..

69 삐약 : 백준 13913| 숨바꼭질4 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/13913  우엑 꽝 기각...중략... q.offer(new Location(N, new StringBuilder().append(N)));...중략... while(!q.isEmpty()){ Location l = q.poll();...중략... ways=l.way.toString(); } } if(l.x+1 초반에는 위치 값과 진행 순서를 문자열로 저장하는 클래스를 선언하여 문제를 풀이하려 했다.그러나 이전에도 겪었듯이 문자열 클래스를 사용하는 것은 메모리상에도 접근하는 시간 상에도 큰 부담을 줄 수 있다는 것을 알고 있기에변동성..

68 삐약 : 백준 2573| 빙산 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/2573 package BKD_0x9_BFS;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class BOJ_2573 { static int[][] glacier; static int[][] visited; static int N; static int M; static int[] dx = {1,-1,0,0}; static int[] dy = {..

67 삐약 : 백준 5427| 불 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/5427 package BKD_0x9_BFS;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class BOJ_5427 { static char[][] building; static Queue person; static Queue fire; static int[] dx={1,-1,0,0}; static int[] dy={0,0,1,-1}; pub..

64 삐약 : 백준 6593| 상범 빌딩 [바킹독 문제 풀이|BFS|JAVA]

https://www.acmicpc.net/problem/6593 package BKD_0x9_BFS;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class BOJ_6593 { static int[] dz ={0,0,0,0,1,-1}; static int[] dy ={0,0,1,-1,0,0}; static int[] dx ={1,-1,0,0,0,0}; static int L; static int R; ..

728x90