APIO 2020 Problems and Solutions – Fun Tour
Time limit 2 s Memory limit 512 MB Problem : There are NN attractions in the biggest theme park in Jakarta, numbered from 00 to N - 1N−1. These attractions are connected by N - 1N−1 bidirectional roads such that there is a unique path between any pair of attractions through