UVA - 10305 Ordering Tasks

最新推荐文章于 2021-02-04 21:43:38 发布

原创最新推荐文章于 2021-02-04 21:43:38 发布 · 452 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#ACM #C++ #uva #解题 #数据结构

+ 搜索专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一个典型的任务排序问题，其中涉及多个任务之间的依赖关系，并提供了一种通过深度优先搜索实现的拓扑排序算法来解决该问题。输入包含任务数量及其直接前置任务的关系，输出则为一种可能的任务执行顺序。

Problem F

Ordering Tasks

Input: standard input

Output: standard output

Time Limit: 1 second

Memory Limit: 32 MB

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

The input will consist of several instances of the problem. Each instance begins with a line containing two integers, 1 <= n <= 100 and m. 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. An instance with n = m = 0 will finish the input.

Output

For each instance, print a line with n integers representing the tasks in a possible order of execution.

Sample Input

5 4

1 2

2 3

1 3

1 5

0 0

Sample Output

1 4 2 5 3

#include <bits/stdc++.h>
using namespace std;

int cmp[128][128];
int flag[128];
int res[128];
int m, n, cnt;

bool dfs(int u)
{
    flag[u] = -1;
    for(int v = 1; v <= m; v++)
        if(cmp[u][v])
        {
            if(flag[v] == -1)
                return false;
            else if(!flag[v] && !dfs(v))
                return false;
        }
    flag[u] = 1;
    res[cnt--] = u;
    return true;
}

bool toposort()
{
    memset(flag, 0, sizeof(flag));
    for(int u = 1; u <= m; u++)
        if(!flag[u] && !dfs(u))
            return false;
    return true;
}

int main()
{
    while(cin >> m >> n, !(m==0 && n==0))
    {
        cnt = m;
        memset(cmp, 0, sizeof(cmp));
        while(n--)
        {
            int x, y; cin >> x >> y;
            cmp[x][y] = 1;
        }
        toposort();
        for(int i = 1; i <= m; i++)
        {
            if(i>=2) putchar(' ');
            printf("%d", res[i]);
        }
        printf("\n");
    }
    return 0;
}