[20251105] BOJ / G5 / 아우으 우아으이야!! / 이준희 #1318
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/15922
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
평면 상의 선분들의 시작좌표, 끝 좌표가 주어졌을 때
그려지는 선분의 총 길이를 구하는 문제입니다.
🔍 풀이 방법
주어지는 입력으로 이미 시작점 기준 오름차순으로 정렬되어 있기 때문에
다음에 나오는 선분의 시작점이 기존 선분의 끝점보다 안에 있으면 겹치는 선분으로 간주하여
끝점을 늘려가는 방식으로 진행했습니다.
⏳ 회고
문제 이름이 이상해서 안풀고 있었는데 꿀문제였습니다.