poj 2367 Genealogical tree (拓扑排序)
来源:互联网 发布:浙大网新恒天软件福利 编辑:程序博客网 时间:2024/06/06 09:07
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
题解
我学OI一年多了才学会这傻逼玩意……真是太菜了……这题的拓扑排序真是裸的不能再裸……但是我还是调很久……WAWAWA……
代码
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n, x, dis[1010][1010], in[1010];int main() { scanf("%d", &n); for(int i = 1; i <= n; i ++) while(scanf("%d", &x) && x) dis[i][x] = 1, in[x] ++; int queue[1010], head = 0, tail = 0; for(int i = 1; i <= n; i ++) if(! in[i]) queue[++ tail] = i; while(head < tail) { int u = queue[++ head]; printf("%d ", u); for(int i = 1; i <= n; i ++) if(dis[u][i]) { in[i] --; if(! in[i]) queue[++ tail] = i; } } return 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【拓扑排序 && 水题】
- Educational Codeforces Round 30
- 去除数组重复元素的四种方法
- 各个模型特征总结学习
- js笔记—— 基础部分一
- 问题总结(1)
- poj 2367 Genealogical tree (拓扑排序)
- maven windows安装
- Java8 I/O源码-FilterInputStream、FilterOutputStream与装饰器模式
- SPFA——玛丽卡
- 整理的遥感期刊,SCI检索,3/4区居多
- 泊松曲面重建
- win10配置java环境变量(javac不是内部命令)
- 知乎网友对线程池的讲解
- 数据库补充学习(3):SQL语言分类及例子