12831 - Maze Cost Sorting
|
Time |
Memory |
| Case 1 |
1 sec |
32 MB |
| Case 2 |
1 sec |
32 MB |
| Case 3 |
1 sec |
32 MB |
| Case 4 |
1 sec |
32 MB |
| Case 5 |
1 sec |
32 MB |
Description
HINT:
It is not necessary to traverse through the maze.
You can use "for loop" to check each node to count the number of neighbors for each node.
Input
Output
Tags