Reward HDU杭电2647【反向拓扑+队列】
来源:互联网 发布:mac如何复制粘贴文字 编辑:程序博客网 时间:2024/06/05 20:36
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.
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.
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 11 22 21 22 1
Sample Output
1777-1
//我的思路是:先反向拓扑,然后一次一次的把入度为零的找出来,加上888,第二次找到的就加889,依此类推
#include<cstdio>#include<cstring>#include<queue>using namespace std;struct Reward{int next;int follow;}arr[20200];int head[20200];int indegree[11000];int st;int n;int sum;bool topo_sort(){int j=1,k;int temp;queue<int>q;while(j<=n){temp=-1;for(int i=1;i<=n;++i){if(indegree[i]==0){sum+=st;temp=i;q.push(i);indegree[i]=-1;++j;}}st++;if(temp==-1) return 0;while(!q.empty()){int pos=q.front();q.pop();for(k=head[pos];k!=-1;k=arr[k].next){int v=arr[k].follow;indegree[v]--;}}}return 1;}int main(){int a,b,m;while(~scanf("%d%d",&n,&m)){st=888;sum=0;memset(head,-1,sizeof(head));memset(indegree,0,sizeof(indegree));for(int i=1;i<=m;++i){scanf("%d%d",&a,&b);arr[i].next=head[b];arr[i].follow=a;//反向存边head[b]=i;indegree[a]++;}if(!topo_sort()) printf("-1\n");else printf("%d\n",sum);}return 0;}
0 0
- Reward HDU杭电2647【反向拓扑+队列】
- hdoj 2647 Reward 【反向拓扑 队列实现】
- HDU 2647 Reward(反向拓扑)
- 【HDU】-2647-Reward(反向拓扑)
- Reward 【反向拓扑+队列实现】
- hdu 2647 Reward 逆拓扑排序+队列
- 杭电2647 Reward(拓扑排序)
- HDU-2647-Reward【拓扑排序】(反向排序)
- 逃生 HDU杭电4857 【反向拓扑+优先队列+反向输出】
- HDOJ 2647 Reward (反向拓扑排序)
- hdu 2647 Reward 拓扑排序
- hdu 2647 Reward 拓扑排序
- hdu 2647 Reward 拓扑排序
- hdu 2647 Reward 拓扑排序
- HDU 2647 Reward(拓扑排序)
- 【HDU】2647 Reward 拓扑排序
- hdu 2647 Reward 拓扑排序
- hdu 2647 Reward 拓扑排序。
- 确定比赛名次--hdoj
- sysfs API总结
- hdu 5381 The sum of gcd 莫队 + DP
- 无常生活,有限奋斗
- OC - ProtocolAndDelegate
- Reward HDU杭电2647【反向拓扑+队列】
- URAL-1225 Flags
- 二分匹配 HDU2063 过山车
- Hdu 2015 Multi-University Training Contest8
- Hit 2255 Not Fibonacci
- asp.net mvc dropdownlist
- 利用curl_multi_init并行多线程处理网络数据
- 蚂蜂窝特价 v4.4.0 官方安卓版
- hdu 5381 The sum of gcd