[20250616] BOJ / P3 / Xor Maximization / 권혁준 #362
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/11191
🧭 풀이 시간
21분
👀 체감 난이도
✏️ 문제 설명
N개의 수들을 적절히 골라 XOR 했을 때의 최댓값 구하기
🔍 풀이 방법
[사용한 알고리즘]
N개의 수들 각각에 대해, 가장 큰 비트부터 내려가며 각 비트에 대한 basis를 구한다.
이들 basis끼리는 선형독립이기 때문에 이 basis들 만으로 N개의 모든 수에 대한 XOR조합을 표현할 수 있다.
답을 구할 때는 가장 큰 비트의 basis부터 xor해보며 최댓값을 갱신해주면 된다.
⏳ 회고
전에 비슷한 걸 했었어서 기억남