[BOJ] 4991. 로봇 청소기(BFS, 순열)
#. Problemhttps://www.acmicpc.net/problem/4991* 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] 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이므로,..
[BOJ] 20040.사이클 게임(Union,Find).java
#. Problemhttps://www.acmicpc.net/problem/20040* 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 간선을 하나씩 그어보면서그래프에 ..
#. Problemhttps://www.acmicpc.net/problem/16398* 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 이 문제도 마찬가지로MST 기본 ..
#. Problemhttps://www.acmicpc.net/problem/4386* 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 MST 기본(?) 문제다.가중치가 ..