Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Traveling Salesman
Description Long before the days of international trade treaties, a salesman would need to pay taxes at every border crossed. So your task is to find the minimum number of borders that need to be crossed when traveling between two countries. We model the surface of Earth as a set of polygons in three dimensions forming a closed convex 3D shape, where each polygon corresponds to one country. You are not allowed to cross at points where more than two countries meet. Input Each test case consists of a line containing n ≤ 20). Then follows a line with one integer m (0 < m ≤ 50), and then m lines with queries c, where _{a} c_{b}c and _{a}c are country numbers (starting with 1). No point will be on the line between two connected points, and −10_{b}^{6} ≤ x, y, z ≤ 10^{6} for all points. No two non-adjacent edges of a country share a common point. The input is terminated by a case where c = 0, which should not be processed.Output For each query, output the number of borders you must cross to go from c._{b}Sample Input 6 4 0 0 0 0 0 1 0 1 1 0 1 0 4 1 0 0 1 0 1 1 1 1 1 1 0 4 0 0 0 1 0 0 1 0 1 0 0 1 4 0 1 0 1 1 0 1 1 1 0 1 1 4 0 0 0 0 1 0 1 1 0 1 0 0 4 0 0 1 0 1 1 1 1 1 1 0 1 2 1 2 1 3 0 Sample Output 2 1 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator