zoukankan      html  css  js  c++  java
  • UVA

    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 mn 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("
    ");
        }
        return 0;
    }


  • 相关阅读:
    yum插件yum-fastestmirror
    mysql利用yum安装指定数据存放路径
    快速搭建Seeddms文档管理系统
    Oracle单实例启动多个实例
    HTTP 304状态分析
    Oracle快速克隆安装
    Linux安装SQLite轻量级数据库
    redhat利用yum快速搭建LAMP环境
    将博客搬至CSDN
    GenericServlet 、Servlet和httpServler他们之间的关系
  • 原文地址:https://www.cnblogs.com/kunsoft/p/5312781.html
Copyright © 2011-2022 走看看