(拓扑排序)poj2367,Genealogical tree
来源:互联网 发布:解说词配音软件 编辑:程序博客网 时间:2024/05/20 18:52
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3264 Accepted: 2198 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
Source
Ural State University Internal Contest October'2000 Junior Session
基础入门题目,无需判断是否有环。
DFS解法:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 105;typedef long long LL;const int INF = 0xfffffff;int N;int G[maxn][maxn];int topo[maxn], t, c[maxn];void dfs(int u){c[u] = -1;for (int v = 0; v <= N;v++)if (G[u][v])if (!c[v])dfs(v);c[u] = 1; topo[--t] = u;}void toposort(){t = N;memset(c, 0, sizeof(c));for (int u = 1; u <= N;u++)if (!c[u])dfs(u);}int main(){//freopen("f:\\input.txt", "r", stdin);while (cin >> N){memset(G, 0, sizeof(G));for (int i = 1; i <= N; i++){int tmp;while (cin >> tmp&&tmp)G[i][tmp] = 1;}toposort();for (int i = 0; i < N-1; i++)printf("%d ", topo[i]);printf("%d\n", topo[N - 1]);}return 0;}
0 0
- (拓扑排序)poj2367,Genealogical tree
- POJ2367 Genealogical tree (拓扑排序)
- POJ2367 Genealogical tree(拓扑排序)
- poj2367 Genealogical tree【拓扑排序】
- POJ2367——Genealogical tree(拓扑排序模板)
- poj2367 Genealogical tree 拓扑排序初接触
- poj2367 Genealogical tree(拓扑排序:输出方案)
- poj2367 Genealogical tree (裸拓扑排序)
- 拓扑入门 poj2367 Genealogical tree
- [学习][poj2367]拓扑序 Genealogical tree
- Genealogical tree(拓扑排序)
- Genealogical tree(拓扑排序)
- Genealogical tree 拓扑排序
- URAL - 1022 - Genealogical Tree(拓扑排序)
- POJ Genealogical tree(拓扑排序)
- POJ 2367:Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree(拓扑排序)
- 2. 第一个 PHP 页面
- 求最长连续相同的字母序列长度
- js对象属性值访问
- android开发 - 编程实现布局界面
- Android获取当前最前面的Activity
- (拓扑排序)poj2367,Genealogical tree
- javaNIO操作
- Ubuntu 安装oracle
- android开发 - JSON解析
- 将 .NET 任务作为 WinRT 异步操作公开
- POJ 1061 青蛙的约会(初遇扩展gcd--解最小正整数解)
- centos6.6 x86_64 install virtualbox 增强功能和ulipad
- android开发 - ListView
- VS2010建Win32 API程序