poj2367Genealogical tree 拓扑排序
来源:互联网 发布:沙钢网络培训教育学院 编辑:程序博客网 时间:2024/06/05 11:25
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6167 Accepted: 4070 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<iostream>#include<queue>#include<cstdio>#define N 300using namespace std;int n,cnt=0,tot=0;queue<int> q;int ans[N],head[N],next[N],to[N],du[N];void add_edge(int x,int y){ to[++tot]=y; next[tot]=head[x]; head[x]=tot;}void toposort(){ while(!q.empty()) { int x=q.front();ans[cnt++]=x;q.pop(); for (int i=head[x];i;i=next[i]) { int y=to[i]; du[y]--; if (!du[y]) q.push(y); } }}int main(){ cin>>n; for (int i=1;i<=n;i++) { int j; while(cin>>j && j) { add_edge(i,j); du[j]++; } } for (int i=1;i<=n;i++) if (!du[i]) q.push(i); toposort(); for (int i=0;i<cnt;i++) { cout<<ans[i]; if (i != cnt-1) cout<<' '; } cout<<endl; return 0;}
阅读全文
0 0
- poj2367Genealogical tree 拓扑排序
- POJ2367Genealogical tree拓扑排序&前向星
- poj2367Genealogical tree
- poj2367Genealogical tree
- POJ_2367_Genealogical tree(拓扑排序)
- Genealogical tree 拓扑排序
- pku2367 Genealogical tree(拓扑排序)
- POJ2367 Genealogical tree (拓扑排序)
- Genealogical tree(拓扑排序)
- POJ2367 Genealogical tree(拓扑排序)
- Genealogical tree(拓扑排序)
- poj2367 Genealogical tree【拓扑排序】
- POJ 2367 Genealogical tree 拓扑排序
- POJ 2367 Genealogical tree [拓扑排序]
- URAL - 1022 - Genealogical Tree(拓扑排序)
- poj2367 Genealogical tree 拓扑排序初接触
- POJ Genealogical tree(拓扑排序)
- ural 1022. Genealogical Tree 拓扑排序
- 贪心(未完成)
- 【摘抄】字符串的再次补充(常量池)
- Java Lambda表达式入门
- 数据库为何要有复合主键(多主键)
- Unity API常用方法和类的解析
- poj2367Genealogical tree 拓扑排序
- java.util.concurrent.TimeUtil类
- 洛谷P2639 [USACO09OCT]Bessie的体重问题Bessie's Weight Probiem
- 6.7年利率
- Android面试题---真实分享
- HDU
- GAN的反卷积
- php配置调优
- LeetCode.599 Minimum Index Sum of Two Lists (经典:哈希表对字符串去重和List与数组间的转换)