UVA10129 BNU18723(拓扑排序)

没有灵魂的程序员

于 2016-11-11 22:35:51 发布

阅读量306

点赞数

分类专栏：排序文章标签： uva

本文链接：https://blog.csdn.net/xky140610205/article/details/53134550

版权

排序专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Ordering Tasks

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVA. Original ID: 10305
64-bit integer IO format: %lld Java class name: Main

Submit Status Statistics Discuss

Type:

None

[PDF Link]

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 from1 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

https://www.bnuoj.com/v3/problem_show.php?pid=18723

给n个数再给1~n之间m对关系

1<2 2<3...................

输出一种从小到大的排序(只要不矛盾就OK)

拓扑排序的模板题

//不包含有向环的有向图为有向无环图(DAG)
#include<stdio.h>
#include<string.h>
#define maxx 1010

int t,n,m;
int ap[maxx][maxx];
int vis[maxx],res[maxx];

bool dfs(int u)
{
    vis[u]=-1;
    for(int i=0; i<n; i++)
        if(ap[u][i])
            if(vis[i]<0)
                return false;
            else if(!vis[i]&&!dfs(i))
                return false;
    vis[u]=1;
    res[--t]=u;
    return true;
}

bool toposort()
{     t=n;
    memset(vis,0,sizeof(vis));
    for(int i=0; i<n; i++)
        if(!vis[i])
            if(!dfs(i))
                return false;
    return true;
}

int main()
{
    int i,u,v;
    while(scanf("%d%d",&n,&m)&&(n||m))
    {
        memset(ap,0,sizeof(ap));
        while(m--)
        {
            scanf("%d%d",&u,&v);
            ap[u-1][v-1]=1;
        }
        toposort();
        for(i=0; i<n; i++)
        {
            printf("%d ",res[i]+1);
        }
        printf("\n");
    }
    return 0;
}