hdu 4494 Teamwork（多源多汇最小费用最大流，巧妙构图）

最新推荐文章于 2019-08-09 20:38:00 发布

acm_cxq

最新推荐文章于 2019-08-09 20:38:00 发布

阅读量5.5k

点赞数

分类专栏：图论-网络流文章标签： ACM HDU

本文链接：https://blog.csdn.net/acm_cxq/article/details/52106107

版权

该博客讨论了如何使用多源多汇最小费用最大流方法解决团队工作分配问题。工人从0号仓库出发，在给定的开始时间和工作时间内，以欧几里得距离为基础计算移动时间。通过分析工人之间的独立性，得出每个技能的工人完成工作所需的最少人数，最终累加得到最少工人总数。博客提到了构图策略，包括设置超级源点和超级汇点，并探讨了如何将地点拆分为满足条件的连接方式。

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

Teamwork

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 450 Accepted Submission(s): 229

Problem Description

Some locations in city A has been destroyed in the fierce battle. So the government decides to send some workers to repair these locations. There are m kinds of workers that were trained for different skills. Each location need some number of some kinds of workers and has a schedule that at what time can the repair begins, and the time cost of repair. Any job cannot begin until all the workers required arrived.
For example, location 1 needs 2 workers of type 1 and 3 workers of type 2, and the beginning time and time cost is 100 minute and 90 minute correspondingly, then 5 workers that satisfy the requirement should arrive before 100 minute, start working at 100 minute and get the job done at 190 minute. Notice that two different types of workers cannot replace each other, so with 3 workers of type 1 and only 2 workers of type 2, this job cannot be done.
Workers can go from one location to another after their jobs are done. You can take the Euclidean distance between locations as the time workers need to travel between them. Each worker should be sent from a depot initially at 0 minute. Now your task is to determine the minimum number of workers needed to be sent from depot so that all the jobs ca