Algo2
GRAPH //// dijackstra const ll N = 1e5+7; vector<pair<ll,ll>>g[N]; bool vis[N]; vector<ll>distancee(N,1e18); ll parent[N]; void djk(ll src) { set<pair<ll,ll>>sat; sat.insert({0,src}); distancee[src] = 0; parent[1] = -1; while(sat.size()>0) { auto pr = *sat.begin(); ll u_wt = pr.ff; ll u = pr.ss; sat.erase(sat.begin()); if(vis[u]) { continue; } vis[u] = true; for(auto &p : g[u]) { ll v = p.ff; ll v_wt = p.ss; if(dista...