【第22期】观点:IT 行业加班,到底有没有价值?

杭电2647 Reward

原创 2015年11月20日 20:29:33

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];
int head[110000],i,j,k,l,m,n,dig[110000],cnt,u,v,ans,flag[110000],num;
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];
		for(i=head[x];i!=-1;i=t[i].next)
		{
			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(head,-1,sizeof(head));
		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;
			t[cnt].next=head[u];
			head[u]=cnt++;
			dig[v]++;
		}
		num=888*m;
		topo();
		printf("%d\n",num);
	}
}



版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

Reward HDU杭电2647【反向拓扑+队列】

Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , ...

HDU 2647 Reward(拓扑排序)

HDU 2647 Reward(拓扑排序) http://acm.hdu.edu.cn/showproblem.php?pid=2647 <span style="font-size: 18px;

程序员升职加薪指南!还缺一个“证”!

CSDN出品,立即查看!

【杭电】[2647]Reward

Reward Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is...

HDU 2647 Reward(拓扑排序)

题目链接:<a href="http://acm.hdu.edu.cn/showproblem.php?pid=2647" target="_blank" style="color: rgb(202,0,0); text-decoratio

hdu 2647 Reward

题目链接:点这里Problem DescriptionDandelion's uncle is a boss of a factory. As the spring festival is comin...
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)