[20250801] BOJ / G1 / 통신소 / 권혁준 #587
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/27115
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
크기가 N*M인 2차원 평면에 통신소가 K곳 존재한다.
좌표 (x, y)에 존재하는 통신소의 전력 p[i]에 대해, (x,y)와 택시 거리가 p[i] 이하인 모든 점들은 통신소와 통신 가능하다.
모든 점 중 통신 가능한 점의 수를 구해보자.
🔍 풀이 방법
거리 P 이내의 점을 찾기 위해, 중심으로부터 계단식 4방향으로 거리를 1씩 줄여 뿌려주는 방식을 사용했다.
⏳ 회고
이왜골1