poj 2367 Genealogical tree 【拓扑排序】
来源:互联网 发布:合肥行知小学怎么样 编辑:程序博客网 时间:2024/06/05 17:10
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3822 Accepted: 2547 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<stdio.h>#include<string.h>int map[110][110];int in[110];int n;void toposort(){int k=0,i,j;for(i=0;i<n;i++){for(j=1;j<=n;j++){if(!in[j]){k=j;break;}}printf(i?" %d":"%d",k);in[k]--;for(j=1;j<=n;j++){if(map[k][j]){in[j]--;}}}printf("\n");}int main(){int i,a;while(scanf("%d",&n)!=EOF){memset(map,0,sizeof(map));memset(in,0,sizeof(in));for(i=1;i<=n;i++){while(scanf("%d",&a),a){if(!map[i][a]){map[i][a]=1;in[a]++;}}}toposort();}return 0;}
0 0
- POJ 2367 Genealogical tree 拓扑排序
- POJ 2367 Genealogical tree [拓扑排序]
- Poj 2367 Genealogical tree(拓扑排序)
- 【POJ】2367 Genealogical tree 拓扑排序
- POJ 2367:Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree 拓扑排序入门
- POJ 2367 Genealogical tree 拓扑排序
- POJ 2367 Genealogical tree(拓扑排序)
- POJ 2367Genealogical tree 简单拓扑排序
- poj 2367 Genealogical tree 【基础拓扑排序】
- POJ 2367 -- Genealogical tree【拓扑排序 && 水题】
- POJ 2367 Genealogical tree(拓扑排序)
- POJ-2367-Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree (拓扑排序)
- Genealogical tree POJ 2367【拓扑排序】
- poj 2367 Genealogical tree(拓扑排序)
- POJ 2367 Genealogical tree(拓扑排序)
- poj 2367 Genealogical tree 【拓扑排序】
- 安装jdk,AndroidStudio,找不到tools.jar
- 有关c++de笔试
- jsp tomcat eclipse 中文乱码
- VMware Workstation网络连接的三种模式
- CentOS7 系统安全加固实施方案介绍
- poj 2367 Genealogical tree 【拓扑排序】
- HDU4183 Pahom on Water(基础) [最大流]来回走不重复点的网络流.
- Uninstall Tool 3.4.3.5410 简体中文注册版(彻底卸载软件)
- 论文笔记6
- 对比下,看看你离企业的要求还有多远
- IOS中UIScrollView的contentSize、contentOffset和contentInset属性
- OpenGL进阶(十) - obj文件的导入
- 【B2B案例】我爱芝麻网:农产品也可以做B2B电商
- 常规功能和模块自定义系统 (cfcmms)—010主界面和菜单的展示和控制(2)