# Reward

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6267    Accepted Submission(s): 1934

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

#include<stdio.h>
#include<queue>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
int u,v,w,next;
}t[1100000];
void topo()
{
//priority_queue<int >q;
//priority_queue<int>q;
queue<int>q;
int i,c=0;
for(i=1;i<=m;i++)
if(dig[i]==0)
{
q.push(i);
//	ans++;
}
while(!q.empty())
{
//int x=q.top();
int x=q.front();
q.pop();
ans++;
num+=flag[x];
{
int y=t[i].v;
dig[y]--;
if(dig[y]==0)
{
q.push(y);
flag[y]=flag[x]+1;
}
}
}
if(ans!=m)
num=-1;
}
int main()
{
while(scanf("%d%d",&m,&n)!=EOF)
{
memset(flag,0,sizeof(flag));
memset(dig,0,sizeof(dig));
cnt=ans=0;
for(i=0;i<n;i++)
{
scanf("%d%d",&v,&u);
t[cnt].u=u;
t[cnt].v=v;
dig[v]++;
}
num=888*m;
topo();
printf("%d\n",num);
}
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：杭电2647 Reward 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)