【杭电oj】2647 - Reward（拓扑排序）（含测试数据）

最新推荐文章于 2023-02-26 11:43:52 发布

wyg1997

最新推荐文章于 2023-02-26 11:43:52 发布

阅读量1.5k

点赞数 1

分类专栏：拓扑图论错题本

本文链接：https://blog.csdn.net/wyg1997/article/details/50976131

版权

博客讨论了杭电oj中的一道题目 Reward，最初误以为是带权并查集，但实际需要使用拓扑排序解决。作者通过分析错误数据，指出图的有向性质和处理顺序的重要性，并给出了特殊测试数据类型，包括普通数据、有独立点的数据和有环的数据。最后，提供了代码实现。

摘要由CSDN通过智能技术生成

Reward

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6725 Accepted Submission(s): 2081

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.