M. Moving Both Hands(图论/最短路径/dijkstra)

题目

题意

给定一个有向图，有n个点，m条带权边
现有n-1个查询，对于点2 d + w) { dist[v][1] = d + w; q.push({dist[v][1], -v}); } } } if (cur.second d + w) { dist[v][1] = d + w; q.push({dist[v][1], -v}); } } } } } void solve() { scanf("%d%d", &n, &m); for (int i = 1; i