Hdu 1596 find the safest road (product shortest)

Question:

Link: Click to open the link

Question:

Ideas:

Just make a slight modification to dijkstra. The product is changed every time dis [] is updated.

Code:

#include 
 
  #include 
  
   #include 
   
    using namespace std;#define INF 100000000const int N = 1010;int n,m;double map[N][N],dis[N];int st,ed;void dijkstra(){    int vis[N];    memset(vis,0,sizeof(vis));    for(int i=1; i<=n; i++)    {        dis[i] = map[st][i];    }    for(int i=1; i
    
      1e-6)            {                maxx = dis[x=y];            }        }        vis[x] = 1;        for(int y=1; y<=n; y++)        {            if(maxx*map[x][y] - dis[y] > 1e-6)                dis[y] = maxx*map[x][y];        }    }    if(dis[ed])        printf("%.3lf\n",dis[ed]);    else        printf("What a pity!\n");}int main(){    //freopen("input.txt","r",stdin);    double s;    while(scanf("%d",&n) != EOF)    {        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                scanf("%lf",&s);                map[i][j] = s;            }        }        scanf("%d",&m);        for(int i=1; i<=m; i++)        {            scanf("%d%d",&st,&ed);            dijkstra();        }    }    return 0;}
    
   
  
 

---------------------------------------------------------------

Gains:

---------------------------------------------------------------

Fighting, never shrinking; fighting, never stopping ~~~~~~~~~