题目链接：点击打开链接
Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7536 Accepted Submission(s): 2381
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
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int MAX=2e4;
int n,m;
struct node
{
int to,next;
}edge[MAX+10];
int num,sum;
int head[MAX+10];
int indegree[MAX+10];
int reward[MAX+10];
void init()
{
memset(head,-1,sizeof(head));
memset(indegree,0,sizeof(indegree));
memset(reward,0,sizeof(reward));
num=0; sum=0;
}
void add(int a,int b)
{
edge[num].to=b;
edge[num].next=head[a];
head[a]=num++;
indegree[b]++;
}
int human[MAX+10];
void topo()
{
queue<int> Q;
while(!Q.empty()) Q.pop();
for(int i=1;i<=n;i++)
{
if(indegree[i]==0)
{
Q.push(i);
reward[i]=888;
}
}
int cnt=0;
while(!Q.empty())
{
int t=Q.front();
Q.pop();
indegree[t]=-1;
sum+=reward[t];
cnt++;
for(int i=head[t];i!=-1;i=edge[i].next)
{
int id=edge[i].to;
if(--indegree[id]==0)
{
reward[id]=reward[t]+1;
Q.push(id);
}
}
}
if(cnt==n)
printf("%d\n",sum);
else
printf("-1\n");
}
int main()
{
while(~scanf("%d %d",&n,&m))
{
init();
int a,b;
while(m--)
{
scanf("%d %d",&a,&b);
add(b,a);
}
topo();
}
return 0;
}
