(POJ 2367)Genealogical tree [top序列] 入门
来源:互联网 发布:网络作家如何挣钱 编辑:程序博客网 时间:2024/06/17 06:15
Genealogical tree
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 6116 Accepted: 4034 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.
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
Source
Ural State University Internal Contest October’2000 Junior Session
题意:
给你一个有向无环图,请输出他的一个top序列。
分析:
有queue,依次输出度为0的节点即可
AC代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;const int maxn = 110;struct edge{ int v,next;}edges[maxn * maxn];int n,head[maxn],e;int d[maxn],ans[maxn];void addedges(int u,int v){ edges[e].v = v; edges[e].next = head[u]; head[u] = e++;}int main(){ int x; while(scanf("%d",&n)!=EOF) { e = 0; memset(head,-1,sizeof(head)); memset(d,0,sizeof(d)); for(int i=1;i<=n;i++) { while(scanf("%d",&x) && x) { addedges(i,x); d[x]++; } } queue<int> q; for(int i=1;i<=n;i++) { if(d[i] == 0) q.push(i); } int num = 0; while(!q.empty()) { x = q.front(); q.pop(); ans[num++] = x; for(int i=head[x];i!=-1;i=edges[i].next) { int v = edges[i].v; d[v]--; if(d[v] == 0) q.push(v); } } printf("%d",ans[0]); for(int i=1;i<num;i++) printf(" %d",ans[i]); printf("\n"); } return 0;}
- (POJ 2367)Genealogical tree [top序列] 入门
- 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 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
- C++中的类所占内存空间
- 后端开发 (1)
- 下拉刷新获取数据的小程序
- js 颜色格式rgb->16进制的转换
- python线程
- (POJ 2367)Genealogical tree [top序列] 入门
- base64图片以blob保存到数据库
- 中小型电商适不适合做seo
- javascript 通过地址栏实现页面间传值(1)
- Django的全文检索功能(一):haystack全文检索的框架
- 爬虫
- SpringMVC中拦截/和拦截/*的区别
- 图像质量评价体系的发展(国内外综合参考)
- easyui日期自定义到分钟