[BOJ] 9466. 텀 프로젝트(DFS, 사이클 찾기)
#. Problemhttps://www.acmicpc.net/problem/9466* 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/2331* 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 연산 결과가 몇 번째로 나왔는지(i..
#. Problemhttps://www.acmicpc.net/problem/10451* 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 생각보다 간단하게 정점들을 DFS..
[BOJ] 1707. 이분 그래프(DFS, BFS)
#. Problemhttps://www.acmicpc.net/problem/1707* 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/11724* 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이 문제도 DFS 혹은 BFS 의 ..
#. Problemhttps://www.acmicpc.net/problem/1260* 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 ..
#. Problemhttps://www.acmicpc.net/problem/1012* 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섬의 개수(?)를 구하는 문제랑 같다..
[Inflearn] 라이언 킹 심바(BFS, priority_queue) (c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 각 격자에는 토기 한 마리가 있거나 없을 수 있음 - 심바와 토끼는 모두 몸 크기를 자연수로 가지고 있음 - 처음 심바의 크기는 2이고 심바는 1초에 인접한 상하좌우 격자칸으로 이동 가능 - 자신의 몸 크기와 같은 마리수 만큼 잡아먹으면 몸의 크기 1 증가 - 0은 빈칸이고, 각 토끼의 크기(1, 2, 3, 4, 5, 6, 7)..