[BOJ] 20652. Stuck in a Rut (simulation)
#. Problem https://www.acmicpc.net/problem/20652 * 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
[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] 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] 16918. 봄버맨(BFS, 시뮬레이션)
#. Problemhttps://www.acmicpc.net/problem/16918* 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] 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] 11559. Puyo Puyo(시뮬레이션).java
#. Problemhttps://www.acmicpc.net/problem/11559* 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 알고리즘을 활용한 문제도 중요하지..