[20251020] BOJ / G5 / 선 긋기 / 한종욱 #1171
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
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/2170
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
1차원에서 선을 긋는데 중첩도 있음. 총 선이 그어진 길이는?
🔍 풀이 방법
스위핑으로 처리함
시작점을 오름차순으로 정렬하고, 선이 끊어질 때마다 더하는 방식으로 구현
⏳ 회고
나랑 로직이 같은데 두 배 더 빠른 사람의 코드랑 정렬 기준을 하나 더 뺐는데 느려지는 점에 대해 찾아보는 중 -> 걍 테케차이인걸로