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/17069
🧭 풀이 시간
70분
👀 체감 난이도
✏️ 문제 설명
파이프를 움직여서 (1,1) -> (N,N)으로 가는 방법의 횟수 구하기
(근데 이제 시간제한이 0.5초인)
🔍 풀이 방법
이전 파이프의 모양에 따라서 갈 수 있는 좌표가 다르므로,
3차원배열 dp 만들어서 가로, 세로, 대각선 각각의 방법 횟수 저장
⏳ 회고
노가다 코드여서 코드 짜놓고 헷갈려서 오래걸림... (설진영 코드 참고해야겠다.)
dp... 열심히 해야징....!