Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/2473
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
주어진 용액들 중 3개의 용액을 선택해서 0에 가장 가까운 혼합 용액 만드려고 할 때, 세 용액 찾기
🔍 풀이 방법
주어진 용액들 오름차순으로 정렬한 뒤,
하나의 용액을 무조건 사용한다고 가정하고, 해당 용액보다 값이 큰 용액들 중에서 나머지 두개의 용액을 찾기 위해서 투포인터 사용
값이 -1,000,000,000 이상 1,000,000,000 이하여서 덧셈을 할 때를 대비해서 Long 사용하기
⏳ 회고
나름 전형적인 투포인터인거 같다