POJ 2367Genealogical tree
2016-08-05 21:16
393 查看
Genealogical tree
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld& %llu
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.
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
5 0 4 5 1 0 1 0 5 3 0 3 0
Sample Output
2 4 5 3 1
#include<cstdio> #include<cstring> int map[110][110]; int indegree[110]; void topo(int n) { int i,j,m,t=0; int queue[110]; for(j=1;j<=n;j++){ for(i=1;i<=n;i++){ if(indegree[i]==0){ m=i;break; } } queue[t++]=m;indegree[m]=-1;//将第一名的前驱数量设为-1 for(i=1;i<=n;++i){//第二步将前驱中含有第一名的点前驱数量减1 if(map[m][i])indegree[i]--; } } for(i=0;i<n;++i){ printf("%d ",queue[i]); } printf("\n"); } int main(){ int n,i,p; while(scanf("%d",&n)!=EOF) { memset(map,0,sizeof(map)); memset(ind 4000 egree,0,sizeof(indegree)); for(i=1;i<=n;i++){ while(scanf("%d",&p),p){ map[i][p]=1; indegree[p]++; } } topo(n); } return 0; }
相关文章推荐
- 强迫症的LaTeX学习笔记
- 动态图-二叉搜索树
- 异常值处理
- 一次图文并茂的渗透完整测试
- Memcache总结
- Linux Socket编程(网络)
- POJ1088(dp)
- 售货员的难题(codevs 2596)
- Java的数组集合概括
- uva 1213 Sum of Different Primes, dp
- c++ 文本处理基础函数
- 服务器防渗透--信息收集
- <jsp:include>和<%@ include %>的区别
- 数据结构与算法大全 目录索引
- C++中linked lists的使用
- C++中linked lists的使用
- nginx tomcat https配置方案
- HDU 5800 To My Girlfriend 背包
- 【python爬虫】爬取知乎收藏夹内所有问题名称地址保存至Mysql
- Alarm(找规律+素数打表)