I need help

Revision en1, by tzhamoidin_twink, 2022-09-08 01:32:49

We have unweighted undirected graph with n vertices and m edges (n < 1e5, m < 1e6). You need to find sum of d(u, v) over all pairs of u v, where d(u, v) — minimal distance between u and v.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English tzhamoidin_twink 2022-09-08 01:32:49 205 Initial revision (published)