Room Evacuation: 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:0107:01, 14 February 2023 Kmk21 talk contribs 958 bytes +958 Created page with "This problem gives us an ASCII description of a room, with people and exits, and asks us how many people can reach an exit in an allotted time. The input size of 20x20, and the intuitive understanding of a "choke point" in the graph strongly indicate that this is a flow problem. We can naturally create a node for each NxM pair, at each time t. We split each node to in-out nodes, with a traversal of 1, to guarantee only a single person traverses a node at any time. We se..."