CF1051F The Shortest Statement

You are given a weighed undirected connected graph, consisting of $ n $ vertices and $ m $ edges. You should answer $ q $ queries, the $ i $ -th query is to find the shortest distance between vertices $ u_i $ and $ v_i $ .

N/A

N/A