牛客网暑期ACM多校训练营（第六场）. Bulbasaur（map容器）

最新推荐文章于 2024-08-09 22:21:37 发布

MiaoPlus

最新推荐文章于 2024-08-09 22:21:37 发布

阅读量315

点赞数

分类专栏： ===========基本算法=========== 文章标签：牛客网暑期ACM多校训练营（第六场） Bulbasaur map容器思维

本文链接：https://blog.csdn.net/XxxxxM1/article/details/81428548

版权

在牛客网的暑期ACM多校训练营中，Bulbasaur面临的任务是优化乘客流量分析系统。系统通过关联人脸与身体照片来分析客流，但可能存在错误关联。每个关联都有正权重。Bulbasaur需要找到一种关联方式，使得关联边的权重之和最大。问题转化为寻找最大权重的匹配问题。

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

链接：https://www.nowcoder.com/acm/contest/144/D
来源：牛客网

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

Silph company deployed a passenger flow analysis system in a clothing store that captures photos of human faces and photos of human bodies in real time.

In order to analyze the passenger flow better, the system will associate human faces with human bodies. In other words, there are some edges connecting faces with bodies. Each edge has a positive weight.

However, due to lack of precision and accuracy of the algorithms provided by this company, these associations may not be completely correct.

In a correct relationship, one human face can associate with multiple human bodies (one person may change multiple suits of clothes), but one human b