2020-2021:teams:mian:weekly_report:2020_summer_week_6_report
| 两侧同时换到之前的修订记录 前一修订版 | |||
|
2020-2021:teams:mian:weekly_report:2020_summer_week_6_report [2020/08/21 15:21] grapelemonade |
2020-2021:teams:mian:weekly_report:2020_summer_week_6_report [2020/08/21 16:10] (当前版本) withinlover |
||
|---|---|---|---|
| 行 85: | 行 85: | ||
| </code></hidden> | </code></hidden> | ||
| ===== Withinlover ===== | ===== Withinlover ===== | ||
| + | |||
| + | [[http://acm.hdu.edu.cn/showproblem.php?pid=6598|HDU6598]] | ||
| + | |||
| + | * 分类：网络流 | ||
| + | * 题意：给定n个点m组关系(u, v, a, b, c)，对点黑白染色，若u, v均为黑色答案加a，均为白色答案加c，一黑一白答案加b。求最大值。 | ||
| + | * 解法：玄学建图，把一条边拆成6条做。转换成最小割问题 | ||
| + | * 评论：建图思路很妙，知道了怎么建图就是板子题了。 | ||
| ===== Gary ===== | ===== Gary ===== | ||
| 行 111: | 行 118: | ||
| ==== 专题 ==== | ==== 专题 ==== | ||
| + | 无 | ||
| ==== 比赛 ==== | ==== 比赛 ==== | ||
| + | ABC175，TCO20R3B | ||
| ==== 题目 ==== | ==== 题目 ==== | ||
| + | |||
| + | CF1379D CF1379E CF1380D CF1380E | ||
| + | |||
| + | ABC175 A-E | ||
| ===== Gary ===== | ===== Gary ===== | ||
2020-2021/teams/mian/weekly_report/2020_summer_week_6_report.1597994481.txt.gz · 最后更改: 2020/08/21 15:21 由 grapelemonade
