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
Recommend
yifenfei | We have carefully selected several similar problems for you: 1285 3342 1811 2680 2112
题意:给你n个人,m对关系(x,y),x的奖金多于y,每个人奖金最少100,输出最少的总奖金数,如果不存在,输出-1
思路:拓扑排序,不过这题要反向建图,这样才好从最低的100遍历过去
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
#define mod 1000000007
#define ll long long
#define maxn 105000
struct Edge
{
int to,next;
}edge[maxn];
int in[maxn],num[maxn],cnt,ans,head[maxn],out[maxn];int n,m;
void addedge(int u,int v)
{
edge[cnt].to=v;
edge[cnt].next=head[u];
head[u]=cnt++;
in[v]++;out[u]++;
}
void init()
{
memset(num,0,sizeof(num));
memset(out,0,sizeof(out));
memset(head,-1,sizeof(head));
cnt=0;ans=0;
memset(in,0,sizeof(in));
}
void slove()
{
int sum=n;queue<int>que;
for(int i=1;i<=n;i++)
{
if(in[i]==0)
{
if(out[i]==0)
{
ans+=888;
sum--;
}
else
{
num[i]=888;
que.push(i);
}
}
}
while(!que.empty())
{
int st=que.front();
sum--;
que.pop();
for(int i=head[st];i!=-1;i=edge[i].next)
{
int v=edge[i].to;
num[v]=max(num[v],num[st]+1);
in[v]--;
if(in[v]==0)
{
que.push(v);
}
}
}
if(sum!=0) printf("-1\n");
else
{
for(int i=1;i<=n;i++) ans+=num[i];
printf("%d\n",ans);
}
}
int main()
{
while(scanf("%d %d",&n,&m)!=EOF)
{
init();
for(int i=1;i<=m;i++)
{
int u,v;
scanf("%d %d",&u,&v);
addedge(v,u);
}
slove();
}
}