Solved Issue #548: The Tag Game (Graph BFS) #556
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
|
Hey @Krishna200608 Thanks for opening this PR 🚀. Mentor will review your pull request soon and till then, keep contributing and stay calm. Thanks for contributing in OpenCode'25 ✨✨! |
Contributor
There was a problem hiding this comment.
Pull request overview
This PR solves Issue #548 by implementing a solution to "The Tag Game" problem from Codeforces (Contest 813, Problem C). The solution uses a double BFS approach to calculate distances from both Alice (starting at node 1) and Bob (starting at node x) to determine the maximum number of moves Alice must make when Bob plays optimally to delay being caught.
Key Changes:
- Implements a graph BFS solution that runs two BFS traversals to compute distances from both players' starting positions
- Identifies nodes Bob can reach before Alice and calculates the maximum distance Alice must travel (2 × distance from root)
- Achieves O(N) time complexity as required for the problem constraints
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
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.
Issue: #548
Problem: The Tag Game (Codeforces 813C)
Approach: Double BFS to calculate distances from Alice and Bob. Optimized for max depth reachable by Bob.
Time Complexity: O(N)
Submission Link:
https://codeforces.com/contest/813/submission/356727323
Screenshot of the submission:
