poj2367
来源:互联网 发布:仙6steam mac 编辑:程序博客网 时间:2024/05/22 03:04
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3663 Accepted: 2437 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
他这里输入是5说明有5行,然后下面第一行是0.说明1不是任何数字的前置条件第二行4 5 1 0说明是2,4和2,5和2,1好难理解的题,不过看懂之后就简单了:
附0ms ac代码:
#include<stdio.h>#include<string.h>int map[110][110],topo[110],i,m,n,j,k,l,a[11000];int main(){scanf("%d",&n);memset(topo,0,sizeof(topo));memset(map,0,sizeof(map));for(i=1;i<=n;i++){for(j=1;;j++){l=j;scanf("%d",&a[j]);if(a[j]==0)break;}for(j=1;j<=l;j++){map[i][a[j]]=1;topo[a[j]]++;}}int flag=0;for(i=1;i<=n;i++){if(!topo[i]){printf("%d",i);topo[i]=1000;for(j=1;j<=n;j++)if(map[i][j])topo[j]--;flag++;i=0;if(flag!=n)printf(" ");elseprintf("\n");}}return 0;}
1 0
- poj2367
- poj2367
- 【POJ2367】
- POJ2367
- POJ2367 Genealogical tree
- poj2367 Genealogical tree
- poj2367 拓扑排序
- POJ2367 拓扑排序入门
- POJ2367--Genealogical tree
- poj2367 Genealogical tree
- poj2367 Genealogical tree
- POJ2367(拓扑排序)
- POJ2367拓扑排序入门
- poj2367 拓扑排序
- poj2367 拓扑排序入门
- <poj2367>Genealogical tree
- 【POJ2367】Genealogical tree
- POJ2367【拓扑排序】
- 使用fis对资源进行打包、压缩、合并、加MD5发布
- 用户登陆登出日志
- js中的"=="和equals()以及is()三者的区别
- OC - ClassAndObject
- Ubuntu下git使用
- poj2367
- Solr 配置文件之schema.xml
- 图论500题
- java:关于字符编码的试题
- 一致性哈希算法及其在分布式系统中的应用
- Android 开发之 SimpleTagImageView自定义ImageView
- hdu 1171 Big Event in HDU 多重背包问题
- hdu5119 Happy Matt Friends(dp)
- IOS UIGraphicsBeginImageContext 使用简介