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/1911
🧭 풀이 시간
70분
👀 체감 난이도
✏️ 문제 설명
왼쪽부터 차례대로 물웅덩이를 처리하면서, 널빤지를 사용하는 최소 개수
🔍 풀이 방법
covered < start이전 널빤지가 현재 물웅덩이까지 안 닿음
covered를 start로 이동
covered < end물웅덩이가 아직 완전히 덮이지 않음
덮어야 할 길이 =
end - covered필요한 널빤지 개수 =
⌈(end - covered) / L⌉널빤지를 놓고
covered업데이트covered >= end아무것도 안 함
⏳ 회고
다시 볼게요 너무 어려웠어요