Seaside
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1369 Accepted Submission(s): 984
Problem Description
XiaoY is living in a big city, there are N towns in it and some towns near the sea. All these towns are numbered from 0 to N-1 and XiaoY lives in the town numbered ’0’. There are some directed roads connecting them. It is guaranteed that you can reach any town from the town numbered ’0’, but not all towns connect to each other by roads directly, and there is no ring in this city. One day, XiaoY want to go to the seaside, he asks you to help him find out the shortest way.
Input
There are several test cases. In each cases the first line contains an integer N (0<=N<=10), indicating the number of the towns. Then followed N blocks of data, in block-i there are two integers, Mi (0<=Mi<=N-1) and Pi, then Mi lines followed. Mi means there are Mi roads beginning with the i-th town. Pi indicates whether the i-th town is near to the sea, Pi=0 means No, Pi=1 means Yes. In next Mi lines, each line contains two integers S
Mi and L
Mi, which means that the distance between the i-th town and the S
Mi town is L
Mi.
Output
Each case takes one line, print the shortest length that XiaoY reach seaside.
Sample Input
5 1 0 1 1 2 0 2 3 3 1 1 1 4 100 0 1 0 1
Sample Output
2
题意很简单,只要随便找到一个近海的city走到就行,因为体重要求city数量不多,所以用了比较简单的floyd:
附ac代码:
#include<stdio.h>
#include<string.h>
#define N 0x3f3f3f
int map[100][100],m,n;
void ac()//floyd找最短路径
{
int i,j,k;
for(i=0;i<m;i++)
for(j=0;j<m;j++)
for(k=0;k<m;k++)
if(map[j][k]>map[j][i]+map[i][k])
map[j][k]=map[j][i]+map[i][k];
}
int main()
{
int i,j,k,l,x,y[100],u,v;
while(scanf("%d",&m)!=EOF)
{
memset(map,N,sizeof(map));
for(i=0;i<m;i++)
{
scanf("%d%d",&x,&y[i]);
if(y[i]==0)
map[i][x]=N;
for(j=0;j<x;j++)
{
scanf("%d%d",&u,&v);
map[i][u]=map[u][i]=v;
}
}
ac();
int ans=N;
for(i=0;i<m;i++)
{
if(y[i])//若果当前city近海,则比较当前结果
if(ans>map[0][i])
ans=map[0][i];
}
printf("%d\n",ans);
}
return 0;
}