Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7268 Accepted Submission(s): 2277
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
曾是惊鸿照影来
原题:http://acm.hdu.edu.cn/showproblem.php?pid=2647
因为数组大所以只能用邻接表,用数组保存邻接表就行了,然后入度改成出度,我没有改变量名。
#include<iostream>
#include<cstring>
using namespace std;
int e[10005][55];
int cnt[10005];
int n, m;
int indegree[10005];
void toposort()
{
int i, j;
bool flag;
int numb;
int add = 888;
int sum=0;
int ans[10005];
int count = 0;
while (count<n)
{
flag = 0;
numb = 1;
for (j = 1; j <= n; j++)
{
if (indegree[j] == 0)
{
ans[numb]= j;
indegree[j]--;
numb++;
sum+=add;
flag = 1;
count++;
}
}
add++;
if (!flag)
{
cout << -1 << endl;
return;
}
for (j = 1; j < numb; j++)
{
for (int k = 1; k < cnt[ans[j]]; k++)
{
indegree[e[ans[j]][k]]--;
}
}
}
cout << sum << endl;
return;
}
int main()
{
int a, b;
while (cin>>n>>m)
{
if (!(m + n))
break;
for (int i = 0; i <= n; i++)
{
indegree[i] = 0;
cnt[i] = 1;
}
for (int i = 0; i<m; i++)
{
cin >> b >> a;
e[a][cnt[a]++] = b;
indegree[b]++;
}
toposort();
}
return 0;
}