[CF1005F] Berland and the Shortest Paths_ Shortest Path Tree _ heap optimization dij

Berland and the Shortest Paths

Topic link: https: //www.codeforces.com/contest/1005/problem/F

Data range: Slightly.

---

answer:

Too Kichiku the ......

It is to ask how many stars there are different shortest path tree.

Because the right side is the $ 1 $.

Then ah .... just need to enumerate the possible non-tree edge enumeration, $ dfs $ on the line ....

I thought it was what the devil immortal title.

Code: (CF collapse code lost)