2020-2021:teams:mian:weekly_report:2020_summer_week_4_report
| 两侧同时换到之前的修订记录 前一修订版 后一修订版 | 前一修订版 | ||
|
2020-2021:teams:mian:weekly_report:2020_summer_week_4_report [2020/08/07 15:17] grapelemonade [Pantw] |
2020-2021:teams:mian:weekly_report:2020_summer_week_4_report [2020/08/07 18:50] (当前版本) gary |
||
|---|---|---|---|
| 行 21: | 行 21: | ||
| ===== Withinlover ===== | ===== Withinlover ===== | ||
| + | |||
| + | [[https://codeforces.com/problemset/problem/546/E|CF 546E]] | ||
| + | |||
| + | * 分类：网络流，输出方案 | ||
| + | * 题意：给定一个图，每个节点上有一定士兵，士兵可以沿边到达距离不超过 1 的点，给定每个点的目标人数，问是否能够达成。 | ||
| + | * 做法：网络流，把每个点拆成入点和出点。判断有解就是最大流是否跑满，输出解按顺序找反向边 | ||
| + | * 评论：细节得慢慢调 | ||
| ===== Gary ===== | ===== Gary ===== | ||
| 行 47: | 行 54: | ||
| ==== 专题 ==== | ==== 专题 ==== | ||
| + | |||
| + | 网络流（总结ing） | ||
| ==== 比赛 ==== | ==== 比赛 ==== | ||
| + | |||
| + | [[https://atcoder.jp/contests/abc174|ABC174]] | ||
| ==== 题目 ==== | ==== 题目 ==== | ||
| + | |||
| + | CF546E CF576B | ||
| ===== Gary ===== | ===== Gary ===== | ||
| 行 58: | 行 71: | ||
| 无 | 无 | ||
| ==== 比赛 ==== | ==== 比赛 ==== | ||
| + | |||
| + | [[https://atcoder.jp/contests/abc174|ABC174]] | ||
| [[http://acm.hdu.edu.cn/contests/contest_show.php?cid=883|2020 Multi-University Training Contest 5]] | [[http://acm.hdu.edu.cn/contests/contest_show.php?cid=883|2020 Multi-University Training Contest 5]] | ||
| + | |||
| ==== 题目 ==== | ==== 题目 ==== | ||
| cf 298 div2 C D E F | cf 298 div2 C D E F | ||
| - | [AtCoder Beginner Contest 149] D E | + | AtCoder Beginner Contest 149 D E |
| 2020 Multi-University Training Contest 5 1001 1007 1009 | 2020 Multi-University Training Contest 5 1001 1007 1009 | ||
2020-2021/teams/mian/weekly_report/2020_summer_week_4_report.1596784655.txt.gz · 最后更改: 2020/08/07 15:17 由 grapelemonade
