POJ-2367-Genealogical tree(拓扑排序)
来源:互联网 发布:信欣美妆淘宝店假货 编辑:程序博客网 时间:2024/05/16 14:23
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3705 Accepted: 2466 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<cstdio>#include<cstring>#include<cstdlib>#include<queue>#include<algorithm>#include<functional>#define max 250using namespace std;int N,M,map[max][max],pre[max];void topu(){int k;priority_queue<int,vector<int>,greater<int> >q;for(int n=1;n<=N;n++){if(!pre[n]){q.push(n);}}int t=0;while(!q.empty()){int top=q.top();q.pop();if(t++)putchar(' ');printf("%d",top);pre[top]--;for(int n=1;n<=N;n++){if(map[top][n]){pre[n]--;if(!pre[n])q.push(n);}}}puts("");}int main(){while(~scanf("%d",&N)){memset(map,0,sizeof(map));memset(pre,0,sizeof(pre));int b;for(int a=1;a<=N;a++){while(scanf("%d",&b),b){if(map[a][b]==0){//重边 map[a][b]=1;pre[b]++;}}}topu();}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 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(拓扑排序)
- poj 2367 Genealogical tree 【拓扑排序】
- iOS开发 -- 屏幕旋转
- Linux学习记录(4)系统常用命令学习
- Java.lang.String 类常用方法
- 学习英文之社区,博客及源码
- VC 读注册表获取安装程序
- POJ-2367-Genealogical tree(拓扑排序)
- android 实现APK之间的跳转
- C#双击文件只让同一个程序打开文件
- oracle wm_concat函数,用于列转行,逗号分隔
- 记录一些易忘的属性(translucent,edgesForExtendedLayout,automaticallyAdjustsScrollViewInsets)
- Bone Collector II
- poj 1047 模拟(含大数乘法)循环数
- hdu 5294 Tricks Device (最短路+最大流)
- uvalive5798(树状数组)