HDU2647 Reward(拓扑排序)反向建图
来源:互联网 发布:人民币账户黄金软件 编辑:程序博客网 时间:2024/05/29 17:26
Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4638 Accepted Submission(s): 1416
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.
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.
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 11 22 21 22 1
Sample Output
1777-1
题意:有n个人,每个人最少发的奖金是888,现有m个要求,有m行a b,表示a 要求 b的奖金多。问能否满足所有的要求,如果能,则n个人得到的奖金总和最少是多少,不能满足所有要求就输出-1。
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N = 10005;int n,mony[N],in[N];vector<int>mapt[N];void init(){ for(int i=1;i<=n;i++) mony[i]=888,in[i]=0,mapt[i].clear();}int tope(){ queue<int>q; int k=0,sum=0; for(int i=1;i<=n;i++) if(in[i]==0) { k++; q.push(i); in[i]=-1; sum+=mony[i]; } while(!q.empty()) { int s=q.front(); q.pop(); for(int i=0;i<mapt[s].size();i++) { int j=mapt[s][i]; if(in[j]>0) { in[j]--; if(mony[j]<mony[s]+1) mony[j]=mony[s]+1; if(in[j]==0) { k++; in[j]=-1; q.push(j); sum+=mony[j]; } } } } if(k==n) return sum; return -1;}int main(){ int m,a,b; while(scanf("%d%d",&n,&m)>0) { init(); while(m--) { scanf("%d%d",&a,&b); in[a]++; mapt[b].push_back(a); } printf("%d\n",tope()); }}
0 0
- HDU2647 Reward(拓扑排序)反向建图
- hdu2647 Reward(拓扑排序+反图)
- hdu2647 Reward(拓扑排序)
- HDU2647-Reward(拓扑排序)
- hdu2647 Reward (拓扑排序)
- HDU2647:Reward(拓扑排序)
- hdu2647 Reward (拓扑排序)
- HDU2647 Reward 【拓扑排序】
- hdu2647 - Reward (拓扑排序)
- HDU2647 Reward 【拓扑排序】
- HDU2647 Reward 拓扑排序
- hdu2647 Reward (拓扑排序)
- hdu2647 Reward--拓扑排序
- HDU2647:Reward(拓扑排序)
- hdu2647 Reward 拓扑排序
- HDU2647 Reward(拓扑排序)
- hdu2647 Reward【拓扑排序】
- HDU2647(拓扑排序+反向建图)
- Java《final关键字》
- 一个关于消除数据依赖性的问题
- 25.创业真的需要app吗?真的需要外包吗?
- jQuery插件学习(一)
- hdu 1541 Stars
- HDU2647 Reward(拓扑排序)反向建图
- JDBC四种驱动类型
- uestc250windy数
- jQuery学习总结(二)
- Nodejs mongoose操作mongodb
- 使用OpenCV2.x计算图像的水平和垂直积分投影
- log4j配置文件整理
- 安卓开发搭建环境遇到的问题
- iOS_关于手机支持的屏幕方向