Genealogical tree POJ - 2367(拓扑模板)
2017-08-03 09:24
405 查看
Genealogic
al tree
POJ
- 2367
be surprised by a hundred of children. Martians have got used to this and their style of life seems to them natural.
And in the Planetary Council the confusing genealogical system leads to some embarrassment. There meet the worthiest of Martians, and therefore in order to offend nobody in all of the discussions it is used first to give the floor to the old Martians, than
to the younger ones and only than to the most young childless assessors. However, the maintenance of this order really is not a trivial task. Not always Martian knows all of his parents (and there's nothing to tell about his grandparents!). But if by a mistake
first speak a grandson and only than his young appearing great-grandfather, this is a real scandal.
Your task is to write a program, which would define once and for all, an order that would guarantee that every member of the Council takes the floor earlier than each of his descendants.
Input
The first line of the standard input contains an only number N, 1 <= N <= 100 — a number of members of the Martian Planetary Council. According to the centuries-old tradition members of the Council are enumerated with the natural
numbers from 1 up to N. Further, there are exactly N lines, moreover, the I-th line contains a list of I-th member's children. The list of children is a sequence of serial numbers of children in a arbitrary order separated by spaces. The list of children may
be empty. The list (even if it is empty) ends with 0.
Output
one such sequence always exists.
Sample Input
5 0 4 5 1 0 1 0 5 3 0 3 0
Sample Output
2 4 5 3 1
代码:
#include<stdio.h> #include<string.h> int mp[110][110],is[110],sor[105]; void topo(int n) { int i,j,m,u; for(j=1; j<=n; j++) { for(i=1; i<=n; i++)//检查入度为0的点并标记 { if(is[i]==0) u=i; } sor[j]=u;//将入度为0的顶点记录到数组里,用来输出 is[u]=-1;//将标记过的挑选出来,以免再次输出 for(i=1; i<=n; i++) { if(mp[u][i])//将与入度为0的点的入度减1, is[i]--; } } for(i=1; i<=n; i++) printf("%d ",sor[i]); printf("\n"); } int main() { int n,m,i,j; scanf("%d",&n); memset(mp,0,sizeof(mp)); for(i=1; i<=n; i++) { while(scanf("%d",&m),m)//不确定数组长度用while输入 { mp[i][m]=1;//记录并标记存在的边 is[m]++;//记录每个点的入度 } } topo(n);//拓扑排序 return 0; }
相关文章推荐
- Genealogical tree POJ 2367【拓扑排序】
- POJ-2367 Genealogical tree 【拓扑模板题】
- E - Genealogical tree POJ - 2367 拓扑排序
- Genealogical tree POJ - 2367
- 树分治基础模板以及树的重心(poj1741 tree)
- POJ 2367 Genealogical tree 【拓扑 基础题】
- POJ 2367 Genealogical tree 拓扑题解
- 树分治(点分治模板)poj-1741 Tree
- poj1741 Tree【点分治模板】
- poj 2367 Genealogical tree(模板)
- POJ 3237 Tree(树链剖分模板)
- POJ2367——Genealogical tree(拓扑排序模板)
- POJ 2367 非常基本的拓扑排序题 用GCC可以AC
- poj 2367 Genealogical tree(拓扑)
- POJ-2367 Genealogical tree (拓扑排序模板)
- poj 3237 tree 树链剖分模板
- poj 1635 Subway tree systems 判断树的同构 树的最大最小表示法模板
- POJ - 1741 Tree 【树的点分治模板题】
- 特殊图poj2367-Genealogical tree poj-1776Task Sequences BZOJ1006: [HNOI2008]神奇的国度
- poj 2367 Genealogical tree【简单拓扑+队列】