Bessie Come Home
Dijkstra 板子
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
|
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int n,a[200][200],dis[200]; bool vis[200]; void init() { memset(a,10,sizeof(a)); cin>>n; char a_,b_; int c_; for(int i=1;i<=n;i++) { cin>>a_>>b_>>c_; a[int(a_)][int(b_)]=min(c_,a[int(a_)][int(b_)]); a[int(b_)][int(a_)]=min(c_,a[int(b_)][int(a_)]); } } void dijkstra(int st) { for(int i=0;i<200;i++) dis[i]=a[int('Z')][i]; memset(vis,false,sizeof(vis)); vis[st]=true; for(int i=0;i<n;i++) { int minn=2000000000; int k=-1; for(int j=0;j<200;j++) if(!vis[j]&&dis[j]<minn) { minn=dis[j]; k=j; } if(k==-1) return; vis[k]=true; for(int j=0;j<200;j++) if(!vis[j]&&(dis[k]+a[k][j]<dis[j])) dis[j]=dis[k]+a[k][j]; } } int main() { //freopen("devil.in","r",stdin); init(); dijkstra(int('Z')); int minn=200000000,k=-1; for(int i=int('A');i<int('Z');i++) if(dis[i]<minn) { minn=dis[i]; k=i; } cout<<char(k)<<' '<<minn<<endl; return 0; }
|
近期评论