poj 2367 Genealogical tree 拓扑排序 解题报告
来源:互联网 发布:怎么看自己淘宝等级 编辑:程序博客网 时间:2024/05/21 18:52
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
分析:
输入有点怪,4 5 1 0 表示2到4,2到5,2到1
代码:
#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>using namespace std;//入度表,结果表int degree[110],res[110];int map[110][110];int n,a,b;void top(){ for(int i=1; i<=n; i++) { //首先,寻找入度为0的点 int p=-1; for(int j=1; j<=n; j++) { if(degree[j]==0) { res[i]=p=j; degree[j]--; break; } } //删掉这个点,及他的边 for(int j=1; j<=n; j++) { if(map[p][j]) { map[p][j]=0; degree[j]--; } } }}int main(){ while(scanf("%d",&n)!=EOF) { memset(degree,0,sizeof(degree)); memset(res,0,sizeof(res)); memset(map,0,sizeof(map)); for(int i=1; i<=n; i++) { while(scanf("%d",&a),a) { if(map[i][a]==0) { map[i][a]=1; degree[a]++; } } } top(); for(int i=1; i<n; i++) printf("%d ",res[i]); printf("%d\n",res[n]); } 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 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(拓扑排序)
- ijkplayer阅读学习笔记之从代码上看播放流程
- Android 抽屉效果的导航菜单实现
- Oracle-hugepages_settings.sh
- windows编译g2o图优化框架(vs2010)
- Jpanel下的键盘事件
- poj 2367 Genealogical tree 拓扑排序 解题报告
- android development tips
- 关于socket通信的理解,socket连接通过IP+端口号的方式,那么如果两个服务器端的应用在同一台机器上,并且位于同一个tomcat容器下,那么岂不是两个服务器都收到了客户端发送的信息
- Canvas+Paint绘制路径,文字与图形
- vmstat
- 开启我的JAVA之旅
- navigation添加BarButtonItem
- iOS开发之设置导航栏为全透明,且去掉边框黑线
- 王学岗按键事件的处理