Bessie Come Home - USACO 2.4.4

bessiecomehome - codetrick

bessiecomehome Bessie Come Home Back to USACO Contents  Kolstad & Burch It's dinner time, and the cows are out in their separate pastures. Farmer John rings the bell so they will start walking to the barn. Your job is to figure out which one cow gets to the barn first (the supplied test data will always have exactly one fastest cow). Between milkings, each cow is located in her own pasture, though some pastures have no cows in them. Each pasture is connected by a path to one or more other pastures (potentially including itself). Sometimes, two (potentially self-same) pastures are connected by more than one path. One or more of the pastures has a path to the barn. Thus, all cows have a path to the barn and they always know the shortest path. Of course, cows can go either direction on a path and they all walk at the same speed. The pastures are labeled `a'..`z' and `A'..`Y'. One cow is in each pasture labeled with a capital letter. No cow is in a pasture labeled with a lower case letter. The barn's label is `Z'; no cows are in the barn, though. PROGRAM NAME: comehome INPUT FORMAT Line 1: Integer P (1 <= P <= 10000) the number of paths that interconnect the pastures (and the barn) Line 2..P+1: Space separated, two letters and an integer: the names of the interconnected pastures/barn and the distance between them (1 <= distance <= 1000) SAMPLE INPUT (file comehome.in) 5 A d 6 B d 3 C e 9 d Z 8 e Z 3 OUTPUT FORMAT A single line containing two items: the capital letter name of the pasture of the cow that arrives first back at the barn, the length of the path followed by that cow. SAMPLE OUTPUT (file comehome.out) B 11

http://qingtangpaomian.iteye.com/blog/1635860
计算出所有顶点到谷仓“Z”的距离，可以使用Dijkstra算法。
http://jackneus.com/programming-archives/bessie-come-home/

https://github.com/TomConerly/Competition-Programming/blob/master/USACO/Chapter2/comehome.java

	int[] dist = new int[N]; Arrays.fill(dist,Integer.MAX_VALUE);
	PriorityQueue<Long> pq = new PriorityQueue<Long>();
	pq.add((0L<<32)|(51));
	while(pq.size() > 0)
	{
	long p = pq.poll();
	int at = (int)(p&0xFFFFFFFFL);
	int cost = (int)(p>>>32);
	if(cost >= dist[at]) continue;
	dist[at] = cost;
	for(int i = 0; i < N;i++)
	{
	if(i==at) continue;
	if(adj[at][i] == -1) continue;
	if(cost + adj[at][i] < dist[i])
	{
	pq.add((((long)cost + adj[at][i])<< 32)|i);
	}
	}
	}
	int maxAt = 26;
	for(int i = 26; i < N-1;i++)
	{
	if(dist[i] == Integer.MAX_VALUE) continue;
	if(dist[maxAt] > dist[i])
	{
	maxAt = i;
	}
	}
	out.println(((char)((maxAt-26)+'A'))+" "+dist[maxAt]);

X. floyd
http://www.cppblog.com/yuziyu/archive/2009/06/28/88701.html
http://blog.csdn.net/kk303/article/details/7031119

void Floyd()
{
     int i,j,k;
     for (k=1;k<=52;k++)
        for (i=1;i<=52;i++)
           for (j=1;j<=52;j++)
              if (d[i][j]-d[i][k]>d[k][j])
                 d[i][j]=d[i][k]+d[k][j];     
}
int main()
{
     freopen("comehome.in","r",stdin);  
     freopen("comehome.out","w",stdout);   
     memset(d,0x7f,sizeof(d));
     scanf("%d",&p);
     while (p--)
     {
            i=getdata();
            j=getdata();
            scanf("%d",&k);
            if (d[i][j]>k) d[i][j]=d[j][i]=k;   
     }
     Floyd();
     int ans=27;
     for (i=27;i<52;i++)
       if (d[i][52]<d[ans][52])
         ans=i;
     printf("%c %d\n",'A'+ans-26-1,d[ans][52]);
     return 0;   
}

Read full article from bessiecomehome - codetrick