Genealogical tree 2367 (拓扑排序)
来源:互联网 发布:网络直播策划案脚本 编辑:程序博客网 时间:2024/05/14 17:00
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3686 Accepted: 2454 Special Judge
Description
The system of Martians' blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather together in different groups, so that a Martian can have one parent as well as ten. Nobody will 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.
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
The standard output should contain in its only line a sequence of speakers' numbers, separated by spaces. If several sequences satisfy the conditions of the problem, you are to write to the standard output any of them. At least one such sequence always exists.
Sample Input
504 5 1 01 05 3 03 0
Sample Output
2 4 5 3 1
#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;int map[110][110];int indegree[110];int n;void Topo(){int i,j,top;for(j=0;j<n;++j){for(i=1;i<=n;++i){if(indegree[i]==0){top=i;break;}}printf(j?" %d":"%d",top);indegree[top]=-1;for(i=1;i<=n;++i){if(map[top][i]){indegree[i]--;}}}printf("\n");}int main(){int a,b;while(scanf("%d",&n)!=EOF){memset(map,0,sizeof(map));memset(indegree,0,sizeof(indegree));for(int i=1;i<=n;++i){while(scanf("%d",&b),b){if(map[i][b]==0){map[i][b]=1;indegree[b]++;}}}Topo();}return 0;}
0 0
- POJ 2367:Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree(拓扑排序)
- Genealogical tree 2367 (拓扑排序)
- POJ 2367 Genealogical tree (拓扑排序)
- POJ 2367 Genealogical tree (拓扑排序)
- POJ-2367 Genealogical tree(拓扑排序)
- POJ 2367Genealogical tree(拓扑排序)
- POJ 2367:Genealogical tree (拓扑排序)
- poj 2367 Genealogical tree (拓扑排序)
- Genealogical tree(拓扑排序)
- Genealogical tree(拓扑排序)
- Genealogical tree 拓扑排序
- POJ 2367 Genealogical tree(简单拓扑排序)
- POJ 2367 Genealogical tree(拓扑排序入门题)
- POJ NO.2367 Genealogical tree(简单拓扑排序,典例)
- POJ:2367 Genealogical tree(普通简单版拓扑排序)
- POJ 2367 Genealogical tree(系谱图,拓扑排序)
- POJ 2418 Hardwood Species
- 基数排序
- hdu 2896 AC自动机 保存编号
- POJ-3326(模拟登录统计)
- 翻转单词+左旋字符串
- Genealogical tree 2367 (拓扑排序)
- P1040 高精度乘法
- GUI
- HDU1285确定比赛名次【拓扑排序】
- C++对象模型——对象复制语意学 (Object Copy Semantics)(第五章)
- Android开发专栏之ListView一两种适配器的使用和优化
- 【python】python新手必碰到的问题---encode与decode,中文乱码[转]
- 高仿知乎日报(三)
- test