【杭电2647】Reward
来源:互联网 发布:天正不能访问到网络锁 编辑:程序博客网 时间:2024/06/05 06:17
Reward
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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
算是copy别人的。。本渣渣没用过vector做邻链表
#include <stdio.h> #include <string.h> #include <vector> using namespace std; int n; int indegree[10005]; vector <int> v[10005]; //用vector做邻链表 //拓扑排序 int topsort(){ int i,j,tag; int countn = 0,q = 0; int tem[10005]; int sum = n * 888; //每个人底钱是888 while(countn != n){ tag = 0; for(i = 1;i <= n;i++){ if(indegree[i]==0)//入度为0 { indegree[i] = -1; //变为-1,防止下次被找到 tem[tag] = i; //排过序的点存入数组 tag++; //记录排过点的个数 } } if(tag==0)//没有入度为0的点,可能存在双向的 { return -1; } else{ sum += q * tag; q++; countn += tag; for(i = 0;i < tag;i++){ for(j = 0;j < v[tem[i]].size();j++){ indegree[v[tem[i]].at(j)]--; } } } } return sum; } int main(){ int m; int i,j; int a,b; while(scanf("%d%d",&n,&m) != EOF){ for(i = 0;i < 10005;i++) v[i].clear(); memset(indegree,0,sizeof(indegree)); while(m--){ scanf("%d%d",&a,&b); int flag = 0; for(i = 0;i < v[b].size();i++){ if(v[b].at(i) == a) flag = 1; } if(!flag){ indegree[a]++; v[b].push_back(a); } } printf("%d\n",topsort()); } return 0; }
队列存储:
#include<cstdio>#include<cstring>#include<queue>using namespace std;int head[10010];int indegree[10010];int mon[10010];int num,sum;struct stu{ int to,next;}edge[20010];void inin(){//初始化 memset(indegree,0,sizeof(indegree)); memset(head,-1,sizeof(head));memset(mon,0,sizeof(mon));num=sum=0;}void add(int a,int b){//添加边 stu E={b,head[a]}; edge[num]=E; head[a]=num++; indegree[b]++;}void topo(int n){int i,j,id,t,ans=0; queue<int>q; while(!q.empty()) q.pop(); for(i=1;i<=n;i++){ if(indegree[i]==0){ q.push(i); mon[i]=888;//第一个最少为888 } } while(!q.empty()){ t=q.front(); q.pop(); indegree[t]=-1; sum+=mon[t]; ans++;//记录排过序的个数 for(i=head[t];i!=-1;i=edge[i].next){ id=edge[i].to; if(--indegree[id]==0){ mon[id]=mon[t]+1;//每次比前一个多一 q.push(id); } } } if(ans==n) printf("%d\n",sum); else printf("-1\n");}int main(){int n,m,i,j,a,b;while(scanf("%d%d",&n,&m)!=EOF){inin();for(i=1;i<=m;i++){ scanf("%d%d",&a,&b); add(b,a);}topo(n);}return 0;}
0 0
- 杭电2647 Reward
- 【杭电2647】Reward
- 【杭电】[2647]Reward
- 杭电2647Reward
- 杭电2647 Reward(拓扑排序)
- 【杭电oj2647】Reward
- Reward HDU杭电2647【反向拓扑+队列】
- 杭电-2641 Reward(拓扑排序)
- 【杭电oj】2647 - Reward(拓扑排序)(含测试数据)
- 杭电acm 3613Best 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
- 人生经验 C#图解教程 学后感悟总结
- HDU:2647 Reward(链表型拓扑排序)
- (二)创建,修改,删除表空间
- Educational Codeforces Round 4 D 扫描线思想
- Spring框架——AOP前置、后置、环绕、异常通知
- 【杭电2647】Reward
- 查看spark on yarn的日志和程序状态的方法
- 1
- 一个零基础体验scala的隐式转换
- 数据结构与算法大全 目录索引
- 指针学习笔记
- poj1840 Eqs
- pyroute2包与网络命名空间
- socket编程之简单的TCP服务器