luogu p3371 單源最短路徑(dijkstral
阿新 • • 發佈:2017-08-26
air gre continue size 手寫 with include syn bits
本來我寫的對的
我就多手寫了個
ios::sync_with_stdio(false);
我程序裏面用了cin 還有scanf 本來想偷偷懶
我就說 我查了半天錯 根本找不到的啊...
後來交了幾次 發現一直有RE 才發現...... 我好笨
//最短路 dijkstral #include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 10010; const ll INF = 2147483647; typedef pair<ll ,int> pli;struct node { int to,cost; node(int t,int c):to(t),cost(c){} bool operator < (const node & a)const { return cost > a.cost; } }; vector<node> E[maxn]; ll d[maxn]; priority_queue<pli,vector<pli>,greater<pli> > Q; int main() {int n,m,st; cin>> n>>m>>st; for(int i=1;i<=m;i++) { int x,y,v; scanf("%d %d %d",&x, &y ,&v); E[x].push_back({y,v}); } for(int i=1;i<=n;i++) { d[i]=INF; } d[st] = 0; Q.push({0,st});while ( Q.size() ) { pli now = Q.top();Q.pop(); ll cost = now.first; int p=now.second; if(cost >= INF) continue; for(int i=0;i<E[p].size();i++) { int v = E[p][i].to; if(d[v] > cost + E[p][i].cost) { d[v] = cost + E[p][i].cost;//更新最短路; Q.push({d[v],v}); } } } for(int i=1;i<=n;i++) { if(i!= n) cout<<d[i]<<" "; else cout<<d[i]; } cout<<endl; }
luogu p3371 單源最短路徑(dijkstral