Created
August 15, 2016 17:00
-
-
Save latte0119/31a07e9e986653baecf59eb0ed5d9a19 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<bits/stdc++.h> | |
using namespace std; | |
#define int long long | |
const int INF=1001001001001001LL; | |
int N,M; | |
int A[200][200],B[200][200]; | |
int dp[2][200]; | |
signed main(){ | |
while(cin>>N>>M,N||M){ | |
fill_n(*A,200*200,INF); | |
fill_n(*B,200*200,INF); | |
for(int i=0;i<N;i++){ | |
A[i][i]=0; | |
B[i][i]=0; | |
} | |
for(int i=0;i<M;i++){ | |
int a,b,c; | |
char d; | |
cin>>a>>b>>c>>d; | |
a--;b--; | |
if(d=='L')A[a][b]=A[b][a]=min(A[a][b],c); | |
else B[a][b]=B[b][a]=min(B[a][b],c); | |
} | |
for(int k=0;k<N;k++){ | |
for(int i=0;i<N;i++){ | |
for(int j=0;j<N;j++){ | |
A[i][j]=min(A[i][j],A[i][k]+A[k][j]); | |
B[i][j]=min(B[i][j],B[i][k]+B[k][j]); | |
} | |
} | |
} | |
int R;cin>>R; | |
int prev;cin>>prev;prev--; | |
fill_n(*dp,2*200,INF); | |
dp[1][prev]=0; | |
for(int i=1;i<R;i++){ | |
int cur;cin>>cur;cur--; | |
for(int j=0;j<N;j++){ | |
for(int k=0;k<N;k++){ | |
if(j!=k)dp[(i+1)&1][j]=min(dp[(i+1)&1][j],dp[i&1][k]+A[prev][k]+B[k][j]+A[j][cur]); | |
else dp[(i+1)&1][j]=min(dp[(i+1)&1][j],dp[i&1][j]+A[prev][cur]); | |
} | |
} | |
for(int j=0;j<N;j++)dp[i&1][j]=INF; | |
prev=cur; | |
} | |
int mi=INF; | |
for(int i=0;i<N;i++)mi=min(mi,dp[R&1][i]); | |
cout<<mi<<endl; | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment