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
2 participants
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/2615
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
오목을 누가 이겼는지 판단하고, 완성된 오목의 가장 왼쪽위 좌표를 출력한다.
🔍 풀이 방법
8방향을 전부 확인하지 않고, 1.오른쪽 2.아래 3.우상단 4.우하단 으로 가는 방향만 검사하고,
6목을 방지하기 위해 첫좌표의 반대로 1만큼 가서 같은 오목이 놓아져 있는지 확인한다.
⏳ 회고
어렵지는 않은데, 좌표 범위 검사 제대로 하자...