Tip! Download our WEBTOON app
to view series offline!
You've reached the preview limit
Creator
Ropeless Homantic wants to find the shortest path to Priority queuetie’s heart in O(vlogv+e) time. When crossing each edge e_i, there is a p_i chance that Ropeless says something dumb and messes up their chances with priority. Find the path that maximizes the probability that Ropeless does not say something dumb.
You may also like
Top Comments
Wanna access your favorite comics offline?
Download
TOP