[20251129] BOJ / G3 / 합이 0인 네 정수 #1541
Merged
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/7453
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
4개 배열의 값들을 모두 더하면 0이 되는 쌍의 개수를 구하시오.
🔍 풀이 방법
2개의 배열을 각각 모두 더하고, 한 가지 배열 정해놓고 이분탐색으로 정답 구하기.
중요한 건 값이 중복될 수 있기 때문에, '0이 되는가?'를 찾는 게 아니라 '0을 만드는 게 몇 개인가?'를 찾아야 한다.
⏳ 회고
answer의 개수가 long 범위인 건 사고지