HDU 2647 Reward(图论-拓扑排序)
来源:互联网 发布:淘宝客自动采集推广 编辑:程序博客网 时间:2024/03/28 17:58
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.
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
Author
dandelion
Source
曾是惊鸿照影来
Recommend
yifenfei | We have carefully selected several similar problems for you: 1285 3342 1811 2680 2112
题目大意:
n个人,m条边,每条边a,b 表示a比b的工资多1,每个人的工资至少888,问你工资和至少多少?如果出现矛盾关系,输出-1
解题思路:
解题思路:根据人的工资关系建立拓扑图,工资尽量从888开始,然后根据是否能全部排好序判断是出现矛盾关系。
#include <iostream>#include <cstdio>#include <queue>#include <vector>using namespace std;const int maxn=11000;int n,m,ans[maxn],r[maxn];vector <vector<int> > v;void input(){ v.clear(); v.resize(n+1); for(int i=0;i<=n;i++){ ans[i]=-1; r[i]=0; } int a,b; while(m-- >0){ scanf("%d%d",&a,&b); v[b].push_back(a); r[a]++; }}void solve(){ queue <int> q; for(int i=1;i<=n;i++){ if(r[i]==0) q.push(i); } int tmp=888; while(!q.empty()){ int qsize=q.size(); while(qsize-- >0){ int s=q.front(); q.pop(); ans[s]=tmp; for(int i=0;i<v[s].size();i++){ int d=v[s][i]; r[d]--; if(r[d]==0) q.push(d); } } tmp++; } int sum=0; for(int i=1;i<=n;i++){ if(ans[i]>0) sum+=ans[i]; else{ sum=-1; break; } } printf("%d\n",sum);}int main(){ while(scanf("%d%d",&n,&m)!=EOF){ input(); solve(); } return 0;}
1 0
- HDU 2647 Reward(图论-拓扑排序)
- HDU 2647 Reward(图论-拓扑排序)
- HDU 2647 Reward(拓扑排序)
- hdu 2647 Reward (拓扑排序)
- hdu 2647 Reward ( 拓扑排序 )
- HDU 2647 - Reward(拓扑排序)
- hdu 2647 Reward (拓扑排序)
- HDU 2647Reward(拓扑排序)
- HDU 2647 Reward(拓扑排序)
- HDU 2647 -- Reward (拓扑排序)
- hdu 2647 Reward(拓扑排序)
- HDU-2647 Reward(拓扑排序)
- HDU 2647Reward (拓扑排序)
- HDU 2647 Reward(拓扑排序)
- HDU 2647 Reward(拓扑排序)
- HDU 2647 Reward(拓扑排序)
- HDU 2647 Reward (拓扑排序)
- HDU 2647 Reward(拓扑排序)
- 导弹拦截系统
- SSH整合中 hibernate整合操作
- wpf——数据绑定DataContext
- rsync 文件同步
- 爸爸和无我编程十条诫律
- HDU 2647 Reward(图论-拓扑排序)
- 针对ubuntu 14.04-64 位安装skyeye环境出现错误的解决
- 简单的并查集应用食物链
- flash builder + AS 如何发送请求
- Android静默安装卸载程序
- MTU设置
- equal和==的区别
- 【c基础】 预处理器 (略有改动)
- C#中DECIMAL ,DOUBLE,FLOAT