单源最短路

呃呃呃 ```cpp #include <bits/stdc++.h> using namespace std; const int N = 1008600; vector<pair<long long, long long> > g[N]; long long d[N]; bool vis[N]; priority_queue<pair<long long, long long> > q; int main(){ memset(vis, false, sizeof vis); long long n, m, s; scanf("%lld %lld...