POJ2367 Genealogical tree
来源:互联网 发布:exe视频格式转换器mac 编辑:程序博客网 时间:2024/05/10 02:07
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 605 Accepted: 441 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<iostream>
#include<cstring>
using namespace std;
int d[101][101],n,m,v[101],in[101];
int main()
{
while(cin>>n)
{
int i,j,b;
memset(in,0,sizeof(in));
memset(d,0,sizeof(d));
memset(v,0,sizeof(v));
for(i=1;i<=n;i++)
{
while(cin>>m)
{
if(m==0) break;
d[i][m]=1;
in[m]++;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(in[j]==0)
{
in[j]=-1;
cout<<j<<" ";
b=j;
break;
}
}
for(j=1;j<=n;j++)
{
if(d[b][j]) in[j]--;
}
}
cout<<endl;
}
return 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 (拓扑排序)
- 拓扑入门 poj2367 Genealogical tree
- POJ2367——Genealogical tree
- POJ2367 Genealogical tree(拓扑排序)
- poj2367 Genealogical tree【拓扑排序】
- poj2367 Genealogical tree 拓扑排序初接触
- (拓扑排序)poj2367,Genealogical tree
- poj2367 Genealogical tree(拓扑排序:输出方案)
- poj2367 Genealogical tree (裸拓扑排序)
- 化归.归纳.类比.联想
- 飞翔的港湾
- iphone开发一些视频
- Davinci调试环境的搭建
- 想需要精彩吗?
- POJ2367 Genealogical tree
- QT
- 求助 html的样式与屏幕的分辨率的兼容
- ASIHTTPRequest 一款强大的HTTP包装开源项目
- HTTP
- SQL操作全集
- JSF实时事件
- 内存数据库研发日志之一.共享内存的诡异问题
- LDD3_NO.5:Initialization and Shutdown