All Questions
5 questions
7
votes
2
answers
218
views
Heights of Cats
I have an assignment to solve this problem. However, I have exceeded the time limit required, can anyone suggest where to improve my code?
Cats like to sit in high places. It is not uncommon to see ...
3
votes
1
answer
2k
views
BFS to check if path from start node to end node exists
I'm trying to solve a problem from leetcode called Jump Game and it seems to be a pretty simple graph problem where we have to find if a path exists from a start node to an end node. I personally ...
- 151
3
votes
0
answers
122
views
SPOJ Fast Matching challenge
I wrote a solution to the MATCHING challenge on SPOJ:
FJ has N (1 ≤ N ≤ 50,000) cows and M (1 ≤ M ≤ 50,000) bulls. Given a list of P (1 ≤ P ≤ 150,000) potential matches between a cow and a bull, ...
- 261
2
votes
1
answer
379
views
Find the number of possible infinite cycles that Bessie the Cow can get stuck in
Bessie the cow is in Farmer John's field. The field is of size 0..1,000,000,000 for x and y. Farmer John knows that there are N/2 wormholes at certain coordinates, but he does not know which wormholes ...
- 29
1
vote
1
answer
108
views
MinCostMaxFlow implementation is not fast enough
I'm trying to solve this problem:
A root tree is a directed acyclic graph that contains one node (root),
from which there is exactly one path to any other node.
A root tree is binary if each ...
- 141