Skip to content

들쥐의 습격 #130

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Merged
merged 1 commit into from
Nov 17, 2020
Merged

들쥐의 습격 #130

merged 1 commit into from
Nov 17, 2020

Conversation

@MinDarin
Copy link
Contributor

@MinDarin MinDarin commented Nov 17, 2020

📘 풀이한 문제
  • 2191 들쥐의 습격
⭐ 문제에서 주로 사용한 알고리즘
  • 그리디
📜 대략적인 코드 설명
  • 쥐가 이동 할 수 있는거리 d = S*V
    2차원 배열을 y는 쥐, x는 구멍으로 잡음 (즉, 모든 쥐 -> 모든 구멍 까지의 거리를 계산해줌)
    우선순위를 1. 들어갈 수 있는 구멍이 작은 쥐 2. 그 중에서도 적은 인원을 수용 할 수 있는 구멍 으로 두어서 풀었습니다.
@jjangsungwon jjangsungwon added the problem-solved Indication that this problem is solved label Nov 17, 2020
@jjangsungwon jjangsungwon merged commit 82c92df into CodeTest-StudyGroup:master Nov 17, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

problem-solved Indication that this problem is solved

2 participants

@MinDarin @jjangsungwon