本文共 2214 字，大约阅读时间需要 7 分钟。
Description
You want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is taking planes. Strangely, in this strange country, for every two cities A and B, there is a flight from A to B or from B to A, but not both. You can start at any city and you can finish your visit in any city you want. You want to visit each city exactly once. Is it possible?
Input
There are multiple test cases. The first line of input is an integer T (0 < T <= 100) indicating the number of test cases. Then T test cases follow. Each test case starts with a line containing an integer n (0 < n <= 100), which is the number of cities. Each of the next n * (n - 1) / 2 lines contains 2 numbers A, B (0 < A, B <= n, A != B), meaning that there is a flight from city A to city B.
Output
For each test case:
- If you can visit each city exactly once, output the possible visiting order in a single line please. Separate the city numbers by spaces. If there are more than one orders, you can output any one.
- Otherwise, output "Impossible" (without quotes) in a single line.
Sample Input
3121 231 21 32 3
Sample Output
11 21 2 3
代码：
#include#include #include #define M 107using namespace std;int vis[M],path[M];int map[M][M];int n;int flag=0;void dijkstra(int x,int step){ path[step]=x; if(step==n) { flag=1; return; } if(flag==1) return; for(int i=1;i<=n;i++) { if(map[x][i]==1&&vis[i]==0) { vis[i]=1; dijkstra(i,step+1); if(flag==1) return; vis[i]=0; } }}int main(){ int t; while(cin>>t) { while(t--) { cin>>n; memset(vis,0,sizeof(vis)); memset(map,0,sizeof(map)); int m=n*(n-1)/2; flag=0; while(m--) { int a,b; scanf("%d%d",&a,&b); if(map[a][b]==0) map[a][b]=1; } for(int i=1;i<=n ;i++) { vis[i]=1; dijkstra(i,1); if(flag==1) { for(int j=1;j
转载地址：https://blog.csdn.net/u010368749/article/details/16829527 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！
发表评论
最新留言
关于作者
