[usaco]Bessie Come Home

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

--------------------------------------------------------------------
本题就是一个拓扑排序,找到到根节点最近的带权节点。
由于最多有26×2=52个节点。因此直接用关联矩阵就可以了。

 

 

 

我的解法:
——————————————————————————————————————————————————————————

/*
ID:yunleis2
PROG:comehome
LANG:C++
*/
#include<iostream>
#include<fstream>
#include<queue>
using namespace std;
int src[26*2][26*2];
int dest[26*2];
int main()
{
	fstream fin("comehome.in",ios::in);
	int p;
	fin>>p;
	for(int i=0;i<52;i++)
	{
		for(int j=0;j<52;j++)
		{
			src[i][j]=-1;
			
			if(i==j)
			{
				src[i][j]=0;
				 
			}
		}
		dest[i]=-1;
	}

	queue<int > q;
	dest['Z'-'A']=0;
	for(int i=0;i<p;i++)
	{
		char a,b;
		int w;
		fin>>a>>b>>w;
		if(a>='a')
			a=a-'a'+'A'+26;
		if(b>='a')
			b=b-'a'+'A'+26;
		if(src[a-'A'][b-'A']==-1||src[a-'A'][b-'A']>w)
		{
			src[a-'A'][b-'A']=w;
			src[b-'A'][a-'A']=w;
		}
	}
 /*
	for(int i=0;i<52;i++)
	{
		for(int j=0;j<52;j++)
		{
			if(i!=j&&src[i][j]!=-1)
				cout<<i<<"\t"<<j<<"\t"<<src[i][j]<<endl;
		}
	}
 */
	q.push('Z'-'A');
	while(!q.empty())
	{
		int t=q.front();
		q.pop();
		for(int i=0;i<52;i++)
		{
			if(src[t][i]!=-1&&(dest[i]==-1||( (src[t][i]+dest[t])<dest[i] )))
			{
				dest[i]=src[t][i]+dest[t];
				q.push(i);
			}
		}

	}
	int ptr=-1;
	for(int i=0;i<26;i++)
	{
		if(dest[i]>0)
		{
			cout<<i<<" "<<dest[i]<<endl;
			if(ptr==-1)
				ptr=i;
			else
				if(dest[i]<dest[ptr])
					ptr=i;
		}
	}
	fstream fout("comehome.out",ios::out);
	fout<<(char)('A'+ptr)<<" "<<dest[ptr]<<endl;
// 	system("pause");
}


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值