HDOJ2647拓扑排序模板程序 连接矩阵实现
来源:互联网 发布:数据挖掘对crm的作用 编辑:程序博客网 时间:2024/06/04 19:57
Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9880 Accepted Submission(s): 3152
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: 3342 1811 2094 2729 1596
问题就是判断是否构成环。
因为数据太小,用一张二维表存储实现起来比较方便,而且很直观。
#include <iostream>#include <ctime>#include <cstring>#include <queue>using namespace std;const int maxn = 105;int i,j,k,m,n,a,b;int MAP[maxn][maxn],du[maxn];void init(){ memset(MAP,0,sizeof(MAP)); memset(du,0,sizeof(du)); for (i=1; i<=m; i++) { cin >> a >> b; if (!MAP[a][b]) { MAP[a][b] = 1; du[b]++; } }}bool tuopu(){ int sum = 0,u,v; queue<int> que; for (i=0; i<n; i++) if (du[i]==0) que.push(i); while (!que.empty()){ u = que.front(); que.pop(); sum++; for (i=0; i<n; i++) if (MAP[u][i]) { du[i]--; if (du[i]==0) que.push(i); } } return sum==n;}int main(){ std::ios::sync_with_stdio(false); while (cin >> n >> m && n+m){ init(); if (tuopu()) cout << "YES" << endl; else cout << "NO" << endl; } return 0;}
- HDOJ2647拓扑排序模板程序 连接矩阵实现
- 拓扑排序算法的程序实现
- 拓扑排序的模板
- 拓扑排序及模板
- 拓扑排序模板
- 拓扑排序模板
- 拓扑排序模板
- 拓扑排序-模板
- 拓扑排序toposort 模板
- 拓扑排序模板
- 拓扑排序模板
- 拓扑排序算法模板
- 拓扑排序【模板】
- 拓扑排序模板
- 拓扑排序模板
- 拓扑排序模板
- 拓扑排序模板
- 拓扑排序模板
- spring 拦截器 spring自定义注解
- 【数据结构和算法】Day 16
- 【51Nod1779】逆序对统计
- 20.软件缺陷管理流程(1)
- tensorflow中slim模块api介绍
- HDOJ2647拓扑排序模板程序 连接矩阵实现
- pycharm+pyqt5的配置(三)
- bugku 求getshell
- 美团2017校招-拼凑钱币
- 动态规划之回文最小分割数
- there is a reason
- android6.0 属性
- Android studio中NDK开发(一):CMakeLists.txt编写入门
- uva 10305 拓扑排序