[20251117] BOJ / G4 / 가르침 / 이준희 #1431
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/1062
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
남극의 모든 단어는 anta 로 시작하고 tica 로 끝납니다.
K개의 알파벳을 가르칠 수 있을 때
N개의 단어 중 읽을 수 있는 단어의 갯수를 구하는 문제입니다.
🔍 풀이 방법
boolean 배열을 이용해서 학습한 알파벳을 파악한 후
각 케이스마다 dfs를 돌았습니다.
⏳ 회고
다 풀고 보니깐 비트마스크를 사용할 수도 있던데 신기했습니다.