POJ 2367 Genealogical tree(拓扑排序)
来源:互联网 发布:otg功能软件下载 编辑:程序博客网 时间:2024/05/16 19:57
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3332 Accepted: 2233 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
#include<stdio.h>#include<string.h>const int N = 105;int mapt[N][N],in[N],n;void tope(){ int path[N],k=0,flag=0; for(int i=1;i<=n;i++) if(in[i]==0) { path[k++]=i; if(flag)printf(" "); flag=1; printf("%d",i); } while(k--) { int s=path[k]; for(int i=1;i<=n;i++) if(mapt[s][i]) { in[i]--; if(in[i]==0) { printf(" %d",i); path[k++]=i; } } } printf("\n");}int main(){ int a; while(scanf("%d",&n)>0) { memset(mapt,0,sizeof(mapt)); memset(in,0,sizeof(in)); for(int i=1;i<=n;i++) { while(scanf("%d",&a)>0&&a) if(mapt[i][a]==0) mapt[i][a]=1,in[a]++; } tope(); }}
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 2367Genealogical 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 2367 Genealogical tree 拓扑排序
- POJ 2367Genealogical tree 简单拓扑排序
- poj 2367 Genealogical tree 【基础拓扑排序】
- POJ 2367 -- Genealogical tree【拓扑排序 && 水题】
- LeetCode-Longest Palindromic Substring
- 使用Django来处理对于静态文件的请求
- Super 关键字在子类构造方法和普通方法中的应用
- JS数据类型判断和数组类型判断
- 深入学习android之AlarmManager
- POJ 2367 Genealogical tree(拓扑排序)
- Android串口开发
- Struts2 总结
- KVO实现自定义文件复制进度展示
- cf Beautiful numbers(数位dp)
- 段页式存储结构概述
- 电脑小技巧70个
- JQ的工具和方法
- TCP连接关闭总结