K. Topological Sort   time limit per test 8.0 s memory limit per test 256 MB input standard input output standard output Consider a directed graph G of N nodes and all edges (u→v) such th