HDU_2647_Reward(拓撲排序)
Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4746 Accepted Submission(s): 1448
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元，現在老板總共至少需要發多少獎金。
如果滿足不了就輸出-1。
分析：拓撲排序問題。比第i個人獎金少的總人數有sum個，那麼第i個人的獎金就是888+sum元。注意此題數據比較大，用鄰接表存吧。
題目鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=2647
代碼清單：
(1) vector實現
#include
