当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3538：A sample Hamilton path

题目描述
Give you a Graph,you have to start at the city with ID zero.
输入解释
The first line is n(1<=n<=21) m(0<=m<=3)
The next n line show you the graph, each line has n integers.
The jth integers means the length to city j.if the number is -1 means there is no way. If i==j the number must be -1.You can assume that the length will not larger than 10000
Next m lines,each line has two integers a,b (0<=a,b<n) means the path must visit city a first.
The input end with EOF.
输出解释
For each test case,output the shorest length of the hamilton path.
If you could not find a path, output -1
输入样例 
3 0
-1 2 4
-1 -1 2
1 3 -1
4 3
-1 2 -1 1
2 -1 2 1
4 3 -1 1
3 2 3 -1
1 3
0 1
2 3
输出样例 
4
5
提示
I think that all of you know that a!=b and b!=0    =。=
来自杭电HDUOJ的附加信息
Recommend zhouzeyong
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2010 ACM-ICPC Multi-University Training Contest（11）——Host by BUPT
源链接： HDU-3538
最后修改于 2020-10-25T23:04:33+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)