LA 4256 Salesman

来源：互联网发布：南宁众才商贸知乎编辑：程序博客网时间：2024/05/21 08:36

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int d[260][260];int dp[260][260];int n,q,a[260];int main(){int T;scanf("%d",&T);while(T--){memset(d,0,sizeof(d));memset(dp,0x3f,sizeof(dp));scanf("%d%d",&n,&q);while(q--){int a,b;scanf("%d%d",&a,&b);d[a][b]=d[b][a]=1;}int len;scanf("%d",&len);for(int i=0;i<len;i++)scanf("%d",&a[i]);for(int k=0;k<=n;k++)if(k==a[0])dp[0][k]=0;elsedp[0][k]=1;for(int i=1;i<len;i++){for(int j=1;j<=n;j++){if(j==a[i]) for(int k=1;k<=n;k++){dp[i][j]=min(dp[i][j],dp[i-1][j]);                if(d[j][k])                dp[i][j]=min(dp[i][j],dp[i-1][k]);                else                dp[i][j]=min(dp[i][j],dp[i-1][k]+1);}elsefor(int k=1;k<=n;k++){dp[i][j]=min(dp[i][j],dp[i-1][j]+1);     if(d[j][k])                dp[i][j]=min(dp[i][j],dp[i-1][k]+1);                else                dp[i][j]=min(dp[i][j],dp[i-1][k]+2);}}}int res=0x3f3f3f3f;    for(int i=1;i<=n;i++)    res=min(res,dp[len-1][i]);     printf("%d\n",res);}}

阅读全文

0 0