八卦一下,Bessie是俺大学最喜欢的老师之一,英语老师,巨可爱一人,哈哈~~
这道题我的思路是BFS+贪心,算是比较典型的Dijkstra算法的应用,另外两个牧场之间可能有多条路径,所以在输入中要做好预处理。因为总共只有52个节点,用排列组合也可以算出来只有2704种可能,所以输入中的许多边都是没有用的。
最后就是要注意后效性,前面对已经访问过的节点,有可能会找到新的路径,使得距离Z节点更近,所以要做两次比较,即下面这段代码,因为这一点,我又WA了一次,唉。。。
if(path_len[i]+graph[i][j] < path_len[j])
path_len[j] = path_len[i]+graph[i][j];
else if(path_len[j]+graph[i][j] < path_len[i])
path_len[i] = path_len[j]+graph[i][j];
/*
ID: fairyroad
TASK:comehome
LANG:C++
*/
#include<fstream>
#include<deque>
#include<climits>
using namespace std;
ifstream fin("comehome.in");
ofstream fout("comehome.out");
inline int charcast(char ch)
{
if(ch - 'A' > 25) return ch-'a';
else return ch-'A'+26;
}
int n;
int graph[52][52];
int path_len[52]; //path_len[i]表示从i表示的字母到Z的距离
int main()
{
int i, j, weight, ia, ib;
fin>>n;
char a, b;
for(i = 0; i < n; ++i)
{
fin>>a>>b>>weight;
ia = charcast(a), ib = charcast(b);
if(graph[ia][ib] == 0 || weight < graph[ia][ib])
{
graph[ia][ib] = weight;
graph[ib][ia] = weight;
}
}
for(i = 0; i < 51; ++i) path_len[i] = INT_MAX;
path_len[51] = 0;
deque<int> Q;
Q.push_back(51);
while(!Q.empty())
{
i = Q.front();
for(j = 0; j < 52; ++j)
{
if(graph[i][j] != 0) // graph[i][j] 等于0 表明道路(i, j)已被访问或道路不通
{
Q.push_back(j);
if(path_len[i]+graph[i][j] < path_len[j])
path_len[j] = path_len[i]+graph[i][j];
else if(path_len[j]+graph[i][j] < path_len[i])
path_len[i] = path_len[j]+graph[i][j];
graph[i][j] = 0; graph[j][i] = 0;
}
}
Q.pop_front();
}
int res = path_len[26], index = 26;
for(i = 27; i <51; ++i)
if(res > path_len[i]){res = path_len[i]; index = i;}
fout<<(char)(index - 26+'A')<<' '<<res<<endl;
return 0;
}