[20250608] BOJ / P2 / mex / 권혁준 #337
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/16902
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
수열 A가 있다.
이 수열에 아래 작업을 M번 수행한다. 각 작업은 정수 x로 나타내어지며, 작업은 총 두 단계로 이루어진다.
🔍 풀이 방법
[사용한 알고리즘]
A에 존재하지 않는 수들만 전부 트라이에 넣어준다.
지금까지의 x값의 누적 XOR값으로 트라이에서 최솟값을 구할 수 있다.
⏳ 회고
..