HDU 2647 Reward

 

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

 

 

Author

dandelion

 

 

Source

曾是惊鸿照影来

 

 

Recommend

yifenfei   |   We have carefully selected several similar problems for you:  1285 3342 1811 2680 2112

题意:给你n个人,m对关系(x,y),x的奖金多于y,每个人奖金最少100,输出最少的总奖金数,如果不存在,输出-1

思路:拓扑排序,不过这题要反向建图,这样才好从最低的100遍历过去

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
#define mod 1000000007
#define ll long long
#define maxn 105000
struct Edge
{
    int to,next;
}edge[maxn];
int in[maxn],num[maxn],cnt,ans,head[maxn],out[maxn];int n,m;
void addedge(int u,int v)
{
    edge[cnt].to=v;
    edge[cnt].next=head[u];
    head[u]=cnt++;
    in[v]++;out[u]++;
}
void init()
{
    memset(num,0,sizeof(num));
    memset(out,0,sizeof(out));
    memset(head,-1,sizeof(head));
    cnt=0;ans=0;
    memset(in,0,sizeof(in));
}
void slove()
{
    int sum=n;queue<int>que;
    for(int i=1;i<=n;i++)
    {
        if(in[i]==0)
        {
            if(out[i]==0)
            {
                ans+=888;
                sum--;
            }
            else
            {
                num[i]=888;
                que.push(i);
            }
        }
    }
    while(!que.empty())
    {
        int st=que.front();
        sum--;
        que.pop();
        for(int i=head[st];i!=-1;i=edge[i].next)
        {
            int v=edge[i].to;
            num[v]=max(num[v],num[st]+1);
            in[v]--;
            if(in[v]==0)
            {
                que.push(v);
            }
        }
    }
    if(sum!=0) printf("-1\n");
    else
    {
        for(int i=1;i<=n;i++) ans+=num[i];
        printf("%d\n",ans);
    }
}
int main()
{
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        init();
        for(int i=1;i<=m;i++)
        {
            int u,v;
            scanf("%d %d",&u,&v);
            addedge(v,u);
        }
        slove();
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值