Traveling Programmer

문제https://www.acmicpc.net/problem/17484풀이(15분)import java.io.*;import java.util.*;public class Main { static int n, m; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine()); n = Integer.parseInt(st.nextToken()); m = I..

문제https://www.acmicpc.net/problem/6118풀이(19분)import java.io.*;import java.util.*;public class Main { static int n, m; static List> graph; static int[] counts; static Queue queue = new LinkedList(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new S..

문제https://www.acmicpc.net/problem/1194풀이(40분)import java.io.*;import java.util.*;public class Main { static int n, m; static char[][] map; static Node start; static int[] dx = {0, 1, 0, -1}; // 사방탐색 static int[] dy = {1, 0, -1, 0}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); ..

문제https://www.acmicpc.net/problem/2468풀이(22분)import java.util.*;import java.io.*;public class Main { static int n, count, answer; static int[][] map; static boolean[][] visited; static Queue queue = new LinkedList(); static int[] dx = new int[]{0,0,-1,1}; static int[] dy = new int[]{-1,1,0,0}; public static void main(String[] args) throws Exception { BufferedReader br..

문제https://www.acmicpc.net/problem/9019풀이(25분)import java.io.*;import java.util.*;public class Main { static final int MAX = 10000; static boolean[] visited; static String[] commands; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int t = Integer.parseInt(br.readLine()); while (..

문제https://www.acmicpc.net/problem/16234풀이(24분)import java.io.*;import java.util.*;class Main { static int n, l, r, count, answer; static int[][] map; static boolean[][] visited; static List points = new ArrayList(); static Queue queue = new LinkedList(); static int[] dx = new int[]{0, 0, -1, 1}; static int[] dy = new int[]{-1, 1, 0, 0}; static boolean flag = false; pub..

문제https://www.acmicpc.net/problem/17142풀이(25분)import java.util.*;import java.io.*;public class Main { static class Virus { int x, y, time; Virus(int x, int y, int time) { this.x = x; this.y = y; this.time = time; } } static final int EMPTY = 0; static final int WALL = 1; static final int VIRUS = 2; static int N, M; static..

문제https://softeer.ai/practice/6246풀이(19분)import java.io.*;import java.util.*;public class Main { // dfs로 하면서 추적하자. // m의 포인트를 리스트로 관리하고, 지도상에는 2로 표시하자. // 만약 dfs 이동 중에 2를 만난다면 현재 포인트 인덱스와 일치하는지를 판단하자. // 아니라면 리턴을 해주어야 한다! static int n, m, answer; static int[][] map; static boolean[][] visited; static Point[] order; static int[] dx = {0, 0, -1, 1}; static int[] dy = ..

문제https://www.acmicpc.net/problem/3980풀이(21분)import java.io.*;import java.util.*;public class Main { static int c, answer; static boolean[] positions; static int[][] ability; public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; c = Integer.parseInt(br.readLine()); ..

문제https://www.acmicpc.net/problem/1563풀이(36분)import java.io.*;public class Main { static int n; static final int MOD = 1_000_000; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); n = Integer.parseInt(br.readLine()); int[][][] dp = new int[n + 1][2][3]; // [날짜][지각 횟수][연속 결석 횟수] ..