본문 바로가기

전체 글

(166)
[백준 JAVA] 1917번: 정육면체 전개도 https://www.acmicpc.net/problem/1917 ## 풀이 사항 풀이 일자: 2024.09.05 풀이 시간: 40분 채점 결과: 정답 예상 문제 유형: 구현, dfs ## 풀이 방법 1. 마지막으로 받은 1의 좌표를 저장해두고 그 좌표부터 dfs를 탐색해준다. 2. map[nr][nc]가 1이고 방문하지 않았다면 dice에 넣어주고 재귀, 빠져나올땐 반대로 돌려준다. 3. dice에서는 방향만을 파라미터로 받고 해당 방향에 따라 주사위를 굴려주고 맨 밑바닥을 1로 바꾼다. 4. dice 배열에 0이 하나라도 있으면 ans -> false : no를 출력해준다. 풀이 방법에 대한 감이 잡히지 않아 주사위를 굴리라는 힌트를 보고 풀었다. 오래 붙잡아도 아이디어가 생각이 안날꺼 같으면 힌트를..
[SWEA JAVA] 5215. 햄버거 다이어트 https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWT-lPB6dHUDFAVT SW Expert AcademySW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요!swexpertacademy.comimport java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.List;import java.util.PriorityQueue;import java.util.Queue;import java.util.StringTokenizer;..
[백준 JAVA] 16236번: 아기 상어 https://www.acmicpc.net/problem/16236 import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.List;import java.util.PriorityQueue;import java.util.Queue;import java.util.StringTokenizer;public class Main { public static int N, ans = 0, s_cnt = 0, s_size = 2; public static int[][] map, visited; public static int[] shar..
[SWEA JAVA] 2117. [모의 SW 역량테스트] 홈 방범 서비스 https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V61LqAf8DFAWu import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class Solution { public static int T, N, M, ans = 0, cnt = 0; public static int[][] map; public static int[] dr = { -1, 0, 1, 0 }; public static int[]..
[SWEA JAVA] 1249. [S/W 문제해결 응용] 4일차 - 보급로 import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.Arrays;import java.util.List;import java.util.PriorityQueue;import java.util.StringTokenizer;public class Solution { public static int T, N, ans = 0; public static int[][] map, visited, MIN; public static int dr[] = { -1, 0, 1, 0 }; public static int dc[] = { 0, 1, 0, -1 }; public static vo..
[백준 JAVA] 1753번: 최단 경로 https://www.acmicpc.net/problem/1753 1. 인접리스트, 다익스트라import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.Arrays;import java.util.List;import java.util.StringTokenizer;public class Main { public static int V, E, s; public static int[] MIN, visited; public static List[] list; public static class Node { int idx; int cost; public Node(int idx,..
[SWEA JAVA] 2115. [모의 SW 역량테스트] 벌꿀채취 https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V4A46AdIDFAWu SW Expert AcademySW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요!swexpertacademy.com   import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class Solution { public static int T, N, M, C, ans = 0, cost1, cost2; public static int[][] ma..
[백준 JAVA] 20187번: 종이접기 https://www.acmicpc.net/problem/20187import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.StringTokenizer;public class Main { public static int k, h, N, curCnt, mode; public static char RR, CR; public static int[][] map; public static int[][] curMap = { { 0, 1, 2, 3 }, { 1, 0, 3, 2 }, { 2, 3, 0, 1 }, { 3, 2, 1, 0 } }; public static void main(String[] args) throws Excep..