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/1034
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
탁자에 있는 램프의 상태와 스위치 누르는 횟수 K가 주어졌을 때, 스위치를 K번 누른 후 켜져있는 행의 최댓값 구하기
(스위치 누르면 열에 있는 램프의 상태가 변함)
🔍 풀이 방법
K값이 짝수개면 0의 개수가 짝수인 곳의 행 전부 1로 만들 수 있음
홀수면 0의 개수가 홀수인 곳의 행 전부 1로 만들 수 있음
HashMap으로 동일하게 등장하는 값 카운팅해줌
⏳ 회고
간단히 생각하면 쉬움