[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] 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 알고리즘을 활용한 문제도 중요하지..
[BOJ] 13335. 트럭(시뮬레이션).java
#. Problemhttps://www.acmicpc.net/problem/13335* 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 시간복잡도가 까다롭지 않아서 Na..
[BOJ] 14499. 주사위 굴리기(시뮬레이션).java
#. Problemhttps://www.acmicpc.net/problem/14499* 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] 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 로봇의 이동을 제어하는 명령을 먼저..
[BOJ] 14923. 미로 탈출(BFS).java
#. Problemhttps://www.acmicpc.net/problem/14923* 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] 3055. 탈출(BFS).java
#. Problemhttps://www.acmicpc.net/problem/3055* 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 R과 C의 범위는 최대 50이므로,..