-
Notifications
You must be signed in to change notification settings - Fork 2
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. Weβll occasionally send you account related emails.
Already on GitHub? Sign in to your account
38-pknujsp #154
Merged
+127
β22
Merged
38-pknujsp #154
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,50 @@ | ||
| # μλ¬Όμ μ μ€κ° λΆλΆμ΄ λͺ¨λ 1μΈμ§ νμΈ | ||
| def is_valid(new_lock): | ||
| length = len(new_lock) // 3 | ||
|
|
||
| for r in range(length, length * 2): | ||
| for c in range(length, length * 2): | ||
| if new_lock[r][c] != 1: | ||
| return False | ||
|
|
||
| return True | ||
|
|
||
| def solution(key, lock): | ||
| n = len(lock) | ||
| k = len(key) | ||
| new_lock = [[0] * (n * 3) for _ in range(n * 3)] | ||
|
|
||
| for r in range(n): | ||
| for c in range(n): | ||
| new_lock[r + n][c + n] = lock[r][c] | ||
|
|
||
| for _ in range(4): | ||
| rev_key = key[::-1] | ||
| key = [] | ||
| for c in range(k): | ||
| row = [] | ||
| for r in range(k): | ||
| row.append(rev_key[r][c]) | ||
| key.append(row) | ||
|
|
||
| """ | ||
| μ΄μ λ₯Ό λ리λ λ‘μ§μ ν μ€λ‘λ ꡬνκ°λ₯ ν©λλ€ | ||
| key = [row for row in zip(*reversed(key))] | ||
| """ | ||
|
|
||
| for r in range(n * 2): | ||
| for c in range(n * 2): | ||
| # μλ¬Όμ μ μ΄μ λ₯Ό λΌμ΄λ€ | ||
| for i in range(k): | ||
| for j in range(k): | ||
| new_lock[r + i][c + j] += key[i][j] | ||
|
|
||
| # μλ¬Όμ μ μ΄μ κ° λ± λ€μ΄κ°λμ§ νμΈ | ||
| if is_valid(new_lock): | ||
| return True | ||
|
|
||
| # μλ¬Όμ μμ μ΄μ λ₯Ό λΉΌμ 볡ꡬμν¨λ€ | ||
| for i in range(k): | ||
| for j in range(k): | ||
| new_lock[r + i][c + j] -= key[i][j] | ||
| return False | ||
This file contains 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
This file contains 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,53 @@ | ||
| def solution(coin, cards): | ||
| a = set(cards[:len(cards) // 3]) | ||
| b = set() | ||
| t = len(cards) + 1 | ||
| r = 1 | ||
|
|
||
| for i in range(len(cards) // 3 + 1, len(cards), 2): | ||
| c1, c2 = cards[i - 1], cards[i] | ||
| b.add(c1) | ||
| b.add(c2) | ||
|
|
||
| removed = False | ||
| # νμ¬ κ°μ§κ³ μλ μΉ΄λ λͺ©λ‘ μ€ n + 1μ΄ κ°λ₯ν κ²½μ° νμΈ | ||
| for x in list(a): | ||
| if t - x in a: | ||
| a.remove(t - x) | ||
| a.remove(x) | ||
| removed = True | ||
| break | ||
|
|
||
| if removed: | ||
| r += 1 | ||
| continue | ||
|
|
||
| # μ½μΈμΌλ‘ κ΅νν΄μ μ»μ μ μλ μΉ΄λ μ€μμ n + 1μ΄ λλ κ²½μ°λ₯Ό μ°ΎμμΌ ν¨ | ||
| # μ½μΈμ΄ μμΌλ―λ‘ μ’ λ£ | ||
| if not coin: | ||
| break | ||
|
|
||
| # `νμ¬ κ°κ³ μλ μΉ΄λ + μ»μ μ μλ μΉ΄λ` = n + 1μ΄ λλ κ²½μ°λ₯Ό νμΈ | ||
| for x in list(b): | ||
| if t - x in a: | ||
| a.remove(t - x) | ||
| b.remove(x) | ||
| removed = True | ||
| coin -= 1 | ||
| break | ||
| # λ§μ§λ§ λ°©λ²μΌλ‘, μ€μ§ κ΅νμΌλ‘ μ»μ μ μλ μΉ΄λ λͺ©λ‘ μ€μμ n + 1μ΄ λλ κ²½μ°λ₯Ό νμΈ | ||
| if not removed and coin >= 2: | ||
| for x in list(b): | ||
| if t - x in b: | ||
| b.remove(t - x) | ||
| b.remove(x) | ||
| removed = True | ||
| coin -= 2 | ||
| break | ||
|
|
||
| # n + 1μ μ΄λ€ κ²½μ°μλ λͺ» λ§λ€λ©΄ μ’ λ£ | ||
| if not removed: | ||
| break | ||
| r += 1 | ||
|
|
||
| return r |
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
μλλ무 λ¬Έμ λ³΄κ³ zipμ΄ listλΌλ¦¬ indexλ₯Ό λ¬Άμ΄μ tupleλ‘ λ°ννλ ν¨μꡬλ νλλ° *reversed(key)λ‘ κ° index μμμ μ κ·Όν΄μ tupleλ‘ λ¬Άμ΄μ£Όλ©΄ νμ μ΄ λλκ΅°μ .... μμ©μ΄ μ΄λ κ² λλ€μ
μ½λκ° μ§μ§ μλ¦μ΄ λλ€μ π«’π