zoukankan      html  css  js  c++  java
  • HDU2647-Reward(拓扑排序)

    Reward

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3854    Accepted Submission(s): 1177


    Problem 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
     
    题意: 有n个人。m个关系:输入a,b 表示a比b大。

    最少的工资为888,让你求最小的工资和


    思路:拓扑排序。依据层数计算每一个人的工资,累加就可以。
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <vector>
    #include <string>
    #include <algorithm>
    #include <queue>
    using namespace std;
    
    const int maxn = 10000+10;
    vector<int> g[maxn];
    int du[maxn];
    int n,m;
    int sum;
    queue<int> que;
    int head[maxn];
    int now;
    void init(){
        sum = 0;
        now = 888;
        memset(du,0,sizeof du);
        for(int i = 0; i <= n; i++) g[i].clear();
        while(!que.empty()) que.pop();
    }
    
    int main(){
    
        while(~scanf("%d%d",&n,&m)){
            init();
            int a,b;
            while(m--){
                scanf("%d%d",&a,&b);
                g[b].push_back(a);
                du[a]++;
            }
            int cnt = 0;
            for(int i = 1; i <= n; i++){
                if(du[i]==0){
                    que.push(i);
                    cnt++;
                }
            }
            while(!que.empty()){
                int qsize = que.size();
                while(qsize--){
                    int k = que.front();
                    sum+=now;
                    que.pop();
                    for(int i = 0; i < g[k].size(); i++){
                        int x = g[k][i];
                        du[x]--;
                        if(du[x]==0){
                            que.push(x);
                            cnt++;
                        }
                    }
                }
                now++;
    
            }
            if(cnt<n){
                printf("-1
    ");
            }else{
                printf("%d
    ",sum);
            }
        }
        return 0;
    }
    


  • 相关阅读:
    IServiceBehavior, IOperationBehavior,IParameterInspector
    System.IO.Pipelines——高性能IO(三)
    System.IO.Pipelines——高性能IO(二)
    System.IO.Pipelines——高性能IO(一)
    背包问题 —— 四种解法解题
    波音,自动驾驶bug未修复,致346人丧生!5个月内两次坠毁!其中,包括8名中国公民
    2018年Java生态行业报告
    为什么大公司一定要使用DevOps?
    设计微服务的最佳实践
    Spring Boot面试题
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/5048279.html
Copyright © 2011-2022 走看看