[BOJ] 20647. Cowntagion (Graph)
#. Problem https://www.acmicpc.net/problem/20647 * The copyright in this matter is in acmicpc #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve 농장 : 1 ~ N^5 길 : 1 ~ N-1 이벤트 1..
[BOJ] 미로 탈출하기(DFS + DP).java
#. Problemhttps://www.acmicpc.net/problem/17090* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 보기에 단순해 보여서 단순하게 풀..
[BOJ] 17142. 연구소 3(BFS).java
#. Problemhttps://www.acmicpc.net/problem/17142* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 코로나 시대..문제처럼 바이러스가..
[BOJ] 3197. 백조의 호수(BFS).java
#. Problemhttps://www.acmicpc.net/problem/3197* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 문제를 풀면서 백조의 호수 BMG이..
[BOJ] 13913. 숨바꼭질 4(BFS, DP).java
#. Problemhttps://www.acmicpc.net/problem/13913* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 이전 숨바꼭질 문제를 풀었다면 나..
[BOJ] 16234. 인구 이동(BFS, 시뮬레이션).java
#. Problemhttps://www.acmicpc.net/problem/16234* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 땅 크기의 범위는 (1 ≤ N ≤..
[BOJ] 14503. 로봇 청소기(시뮬레이션, BFS, DFS).java
#. Problemhttps://www.acmicpc.net/problem/14503* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 시간복잡도는 O(50^2)으로 아..
[BOJ] 1726. 로봇(BFS).java
#. Problemhttps://www.acmicpc.net/problem/1726* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 로봇의 이동을 제어하는 명령을 먼저..