HDU2647-Reward
来源:互联网 发布:软件安全检测平台 编辑:程序博客网 时间:2024/06/11 04:00
Reward
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7714 Accepted Submission(s): 2453
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
Author
dandelion
Source
曾是惊鸿照影来
#include <iostream>#include <stdio.h>#include <queue>#include <string.h>#include <vector>using namespace std;vector<int>G[10005];int visit[10005];int p[10005];int main(){ int n,m; while(~scanf("%d %d",&n,&m)) { int a,b; memset(visit,0,sizeof visit); memset(p,0,sizeof p); for(int i=0;i<=n;i++) G[i].clear(); for(int i=0;i<m;i++) { scanf("%d %d",&a,&b); G[b].push_back(a); visit[a]++; } queue<int>q; for(int i=1;i<=n;i++) { if(!visit[i]) { p[i]=0; q.push(i); } } int t; while(!q.empty()) { t=q.front(); q.pop(); int Size=G[t].size(); for(int i=0;i<Size;i++) { visit[G[t][i]]--; if(!visit[G[t][i]]) { p[G[t][i]]=p[t]+1; q.push(G[t][i]); } } } int i,sum=0; for(i=1;i<=n;i++) { sum+=p[i]; if(visit[i]) break; } if(i>n) printf("%d\n",888*n+sum); else printf("-1\n"); } return 0;}
0 0
- HDU2647 Reward
- hdu2647:Reward
- HDU2647---Reward
- hdu2647 Reward
- HDU2647-Reward
- hdu2647 Reward (拓扑排序)
- hdu2647 && TOJ3648 Reward
- HDU2647 Reward 【拓扑排序】
- hdu2647 - Reward (拓扑排序)
- hdu2647——Reward
- HDU2647 Reward 【拓扑排序】
- HDU2647 Reward 拓扑排序
- hdu2647 Reward (拓扑排序)
- hdu2647 Reward--拓扑排序
- HDU2647:Reward(拓扑排序)
- hdu2647 Reward 拓扑排序
- HDU2647 Reward(拓扑排序)
- hdu2647 Reward【拓扑排序】
- Java开发中的23种设计模式详解
- hdu 5874 构造
- Combination Sum_Leetcode_#39
- Hive 2.1 安装
- 进程通信--管道
- HDU2647-Reward
- Cookie和Session会话管理基础
- 树和二叉树
- Combination Sum II_Leetcode_#40
- effective stl 第18条: 避免使用vector<bool>
- hdu5869——Different GCD Subarray Query(思考+树状数组)
- windows环境下的socket nc 测试小工具nc -L -p 9999
- Python标准库简介
- CCF-201604-3-路径解析