hdu2647(拓扑排序)

本文探讨了工厂老板如何在春节来临之际,合理分配工人奖金,以满足所有工人的期望并使用最少的资金。通过建立结构体和使用广度优先搜索算法解决分配问题,确保每个工人都能得到至少888元的幸运数字奖金。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 <string.h>
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
struct data
{
    int tal,rd,mem[15],cs;

}a[10010];

int bfs(int n)
{
    int x=0;
    while(x<n)
    {
        int flag=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i].rd==0)
            {
                a[i].rd--;
                int tem=a[i].cs+1;
                for(int j=0;j<a[i].tal;j++)
                {
                    a[a[i].mem[j]].rd--;
                    a[a[i].mem[j]].cs=max(tem,a[a[i].mem[j]].cs);
                }
                flag=1;
                x++;
            }
        }
        if(flag==0)return 0;
    }
    return 1;
}



int main()
{
    int m,n;
    while(~scanf("%d%d",&n,&m))
    {
        memset(a,0,sizeof(a));
        for(int i=0; i<m; i++)
        {
            int t1,t2;
            scanf("%d%d",&t1,&t2);
            a[t1].rd++;
            a[t2].mem[a[t2].tal++]=t1;
        }
        int t=bfs(n);
        if(t==0)printf("-1\n");
        else
        {
            int s=888*n;
            for(int i=1;i<=n;i++)
            s+=a[i].cs;
            printf("%d\n",s);
        }
    }
    return 0;
}





转载于:https://www.cnblogs.com/martinue/p/5490531.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值