1940. Ordering Tasks
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed.
Input
There are multiple test cases. The first line contains an integer T, indicating the number of test cases. Each test case begins with a line containing two integers, 1 <= n <= 100000 and 1 <= m <= 100000. n is the number of tasks (numbered from 1 to n) and m is the number of direct precedence relations between tasks. After this, there will be m lines with two integers i and j, representing the fact that task i must be executed before task j. It is guaranteed that no task needs to be executed before itself either directly or indirectly.
Output
For each test case, print a line with n integers representing the tasks in a possible order of execution. To separate them, print exactly one space after each integer. If there are multiple solutions, output the smallest one by lexical order.
Sample Input
1 5 5 3 4 4 1 3 2 2 4 5 3
Sample Output
5 3 2 4 1
题目分析:
这是一道典型的拓扑排序的题目。可以按照题目要求,把拓扑图建立好,然后一次宽度搜索就可以完成。
题目链接:
参考代码:
#include <iostream> #include <cstring> #include <vector> #include <queue> #include <set> #include <stdio.h> using namespace std; const int N = 100009; int main() { int t; scanf("%d", &t); int m, n; int f, s; while (t --) { scanf("%d%d", &m, &n); multiset<int> v[N]; int dev[N]; memset(dev, 0, sizeof(dev)); for (int i = 1; i <= n; ++ i) { scanf("%d%d", &f, &s); v[f].insert(s); ++ dev[s]; } set<int> q; for (int i = 1; i <= m; ++ i) { if (dev[i] == 0) { q.insert(i); } } int count = 0; while (!q.empty()) { set<int>::iterator itt = q.begin(); int tem = *itt; if (count == 0) { printf("%d ", tem); ++ count; } else { printf("%d ", tem); } q.erase(itt); multiset<int>::iterator it = v[tem].begin(); for (; it != v[tem].end(); it ++) { dev[*it] --; if (dev[*it] == 0) { q.insert(*it); } } } printf("\n"); } }
相关推荐
sicily 1562_LVM.cpp参考代码
中山大学 ACM sicily 1294 题目代码
sicily 1274的AC源码,通过且速度快,适合学生使用
本程序解决了Sicily平台上Queue的问题,有较好的可读性
这是C++解题常用的模板,对参加C++机试有较大帮助
本程序是中山大学sicily-1137-1145-1146-1147-1154-1157-1194的代码
西西里全部练习输入输出以及标准程序 超高精度浮点数的输出问题 关联数组
1005. 有向图边的分类 12图算法例题1000. sicily 1155. Can I Post the letteTime Limit: 1sec Mem
sicily 1817和1818的程序,各有两种方法,供参考。
本程序是中山大学sicily 1004-1007-1010-1014-1021 参考代码
本程序是中山大学sicily上1200-1221-1298-1324-1325的参考代码。
包括 sicily online judge 1149等部分题目,线性表,最小生成树,中缀转后缀并计算后缀表达式等。
sicily部分源代码,全都亲测,可通过
中大sicily online judge的刷题指南,里面介绍得很详细,不过,最近sicily好像不能外网访问了。
sicily(soj) 1022 1064 1310 1740 1876 1934 六题的源代码(数据结构综合应用题)
本cpp是sicily的1006的解题代码 这份代码以最简单的方式实现了它的功能要求 值得学习一番
112页的大礼包,sicily的部分ac代码。
Sicily的题目分类:各种题目的分类,大致方法,以及题目难度规范
sicily1007题答案,附代码解释,可以在平台上通过