Skip to content

[20251203] BOJ / G5 / 문자열 판별 / 이인희 #1577

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.

Sign up for GitHub

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

Jump to bottom
Merged
ShinHeeEul merged 1 commit into from
Dec 3, 2025
Merged

[20251203] BOJ / G5 / 문자열 판별 / 이인희 #1577

ShinHeeEul merged 1 commit into from
Dec 3, 2025

Conversation

@LiiNi-coder
Copy link
Contributor

@LiiNi-coder LiiNi-coder commented Dec 3, 2025 •
edited
Loading

🧷 문제 링크

https://www.acmicpc.net/problem/16500

🧭 풀이 시간

55 분

👀 체감 난이도

  • 상
  • 중
  • 하

✏️ 문제 설명

  • 문자열A가 주어지고, 문자열들이 주어질때, 문자열A가 문자열들의 조합으로 만들수있는지 없는지 판별

🔍 풀이 방법

  • dp + hash

⏳ 회고

  • 문자열을 이용한 dp라는 것이 처음에 떠올리기 어려워서 알고리즘을 확인함
  • 그럼에도 딱히 풀이가 안떠올라서 문자열 끝 위치를 잘 만든경우로 두는 boolean dp임을 확인함

@LiiNi-coder LiiNi-coder added the hint 💡 반례를 참고했거나 힌트를 얻고 풀었을 때 label Dec 3, 2025
@ShinHeeEul ShinHeeEul merged commit 8a1bb8f into main Dec 3, 2025
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

No reviews

Assignees

@LiiNi-coder LiiNi-coder

Labels

hint 💡 반례를 참고했거나 힌트를 얻고 풀었을 때

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

3 participants

@LiiNi-coder @ShinHeeEul