zoukankan      html  css  js  c++  java
  • 拓扑排序(2)

    Description

    Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a trouble about how to distribute the rewards. 
    The workers will compare their rewards ,and some one may have demands of the distributing of rewards ,just like a's reward should more than b's.Dandelion's unclue wants to fulfill all the demands, of course ,he wants to use the least money.Every work's reward will be at least 888 , because it's a lucky number.
     

    Input

    One line with two integers n and m ,stands for the number of works and the number of demands .(n<=10000,m<=20000) 
    then m lines ,each line contains two integers a and b ,stands for a's reward should be more than b's.
     

    Output

    For every case ,print the least money dandelion 's uncle needs to distribute .If it's impossible to fulfill all the works' demands ,print -1.
     

    Sample Input

    2 1 1 2 2 2 1 2 2 1
     

    Sample Output

    1777 -1
     
    因为数据范围很大,所以用邻接矩阵做空间不够,如下系统提交过不了
    #include <iostream>
    #include <cstring>
    #include <cstdio>
    using namespace std;
    const int N=1e4+1;
    
    int i,j,k,m,n;
    int map[N][N];
    int indegre[N];
    long long sum;
    
    long long topo()
    {
        int x=888,flag=0;
        for(i=1;i<=n;i++)
        {
            flag=0;
            for(j=1;j<=n;j++)
            {
                if(indegre[j]==0)
                sum=sum+x,flag=1;
            }
            for(j=1;j<=n;j++)
            {
              if(indegre[j]==0)
              {
                  indegre[j]--;
                  for(k=1;k<=n;k++)
                  {
                     if(map[k][j]==1)
                     indegre[k]--;
                  }
              }
            }
           if(flag==0&&i!=n)
           return -1;
           else
           x++;
        }
        return sum;
    }
    
    int main()
    {
        int p1,p2;
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            sum=0;
            memset(map,0,sizeof(map));
            memset(indegre,0,sizeof(indegre));
            for(i=0;i<m;i++)
            {
                cin>>p1>>p2;
                if(map[p1][p2]==0)
                {
                    map[p1][p2]=1;
                    indegre[p1]++;
                }
            }
            printf("%lld
    ",topo());
        }
        return 0;
    }

    用邻接表做可以过
    #include <stdio.h>  
    #include <string.h>  
    #include <vector>  
    using namespace std;  
      
    int n;  
    int indegree[10005];  
    vector <int>  v[10005];  
      
    int topsort(){  
        int i,j,tag;  
        int countn = 0,q = 0;  
        int tem[10005];  
        int sum = n * 888;  
      
        while(countn != n){  
            tag = 0;  
            for(i = 1;i <= n;i++){  
                if(!indegree[i]){  
                    indegree[i] = -1;  
                    tem[tag] = i;  
                    tag++;  
                }  
            }  
            if(!tag){  
                return -1;  
            }  
            else{  
                sum += q * tag;  
                q++;  
                countn += tag;  
                for(i = 0;i < tag;i++){  
                    for(j = 0;j < v[tem[i]].size();j++){  
                        indegree[v[tem[i]].at(j)]--;  
                    }  
                }  
            }  
        }  
        return sum;  
    }  
    int main(){  
        int m;  
        int i,j;  
        int a,b;  
      
        while(scanf("%d%d",&n,&m) != EOF){  
            for(i = 0;i < 10005;i++)  
                v[i].clear();  
            memset(indegree,0,sizeof(indegree));  
            while(m--){  
                scanf("%d%d",&a,&b);  
                int flag = 0;  
                for(i = 0;i < v[b].size();i++){  
                    if(v[b].at(i) == a)  
                        flag = 1;  
                }  
                if(!flag){  
                    indegree[a]++;  
                    v[b].push_back(a);  
                }  
            }  
            printf("%d
    ",topsort());  
        }  
        return 0;  
    }  

      

  • 相关阅读:
    java基础>包、访问权限、命名规范 小强斋
    java基础>Static 和 Final 关键字 小强斋
    java基础>对象的创建过程(初始化、析构、清理) 小强斋
    iPhone 上少用三元操作符 ? :
    QQ群人满了
    面向对象C语言(ObjectiveC)编程简介
    java Integer.ValueOf(int)和new Integer(int)性能比较
    关于在iPhone上合并2个应用程序(App)成一个
    java Preferences持久化使用示例
    Memcache VS MySQL Query Cache.
  • 原文地址:https://www.cnblogs.com/chen9510/p/4739867.html
Copyright © 2011-2022 走看看