Toll Roads: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

14 February 2023

  • curprev 07:4407:44, 14 February 2023 Kmk21 talk contribs 5,418 bytes 0 No edit summary
  • curprev 07:4207:42, 14 February 2023 Kmk21 talk contribs 5,418 bytes +5,418 Created page with "This problem defines a "toll" to traverse a road, and asks of a road network multiple queries of what is the minimum maximum toll to be paid to connect two cities, and how mayn cities can be connected with that toll. The first observation (other than this is probably a graph problem), is that the problem space is too large for something like all pairs shortest path. It should also be apparent that even if we somehow were able to do dijstra, with 10^5 queries, its unlike..."
Retrieved from "https://wiki.speedyguy17.info/index.php/Toll_Roads"