CVBB ACM Team

本页面只读。您可以查看源文件，但不能更改它。如果您觉得这是系统错误，请联系管理员。
====== 2020牛客暑期多校训练营（第十场） ======

===== Results =====

==== Summary ====

  * Solved 7 out of 12 problems
  * Rank 32/1041 in official records
  * Solved 8 out of 12 afterwards

<HTML>
<table>
<style>
td, th {text-align: center;}
.accepted {color: #0a0;font-weight: bold;}
.failed {color: #00a;}
.cell-time {font-size: 1.0rem;display: block;}
.contest-name {font-size: 1.5em;color: #445f9d;}
.successfulChallengeCount {color: green;}
.unsuccessfulChallengeCount {color: gray;}
</style>
<tr><th>#</th><th>Who</th><th>=</th><th>Penalty</th><th>A</th><th>B</th><th>C</th><th>D</th><th>E</th><th>F</th><th>G</th><th>H</th><th>I</th><th>J</th><th>Dirt</th></tr>
<tr><td>11</td><td>大吉大利，今晚吃 mian();</td><td>3</td><td>534</td><td><span class="accepted">+1</span><br>02:01</td><td></td><td></td><td></td><td><span class="accepted">+1</span><br>01:07</td><td></td><td></td><td><span class="failed">-2</span></td><td><span class="failed">-3</span></td><td><span class="accepted">+2</span><br>04:26</td><td><span><b>57%</b></span><br>4/7</td></tr></table>
</HTML>

==== Member Distribution ====

^    Solved     ^  A  ^  B  ^  C  ^  D  ^  E  ^  F  ^  G  ^  H  ^  I  ^  J  ^
|     Pantw     |     |     |     |     |     |     |     |     |     |  √  |
|  Withinlover  |     |     |     |     |  √  |     |     |     |     |     |
|     Gary      |  √  |     |     |     |     |     |     |     |     |     |

(√ for solved, O for upsolved, - for tried but not solved)


----

====== Solutions ======

===== A =====

半天也没搞懂怎么证得，尽量选2，不能选2就选一次3

===== B =====

===== C =====

===== D =====

===== E =====

二分然后暴力从后往前推就好了
===== F =====

===== G =====

===== H =====

===== I =====

===== J =====

考虑 DP。对每个结点，考虑其所有儿子的子树，算出它们与对应点的儿子的子树的权值 G[i][j]，算出来之后把它们建成二分图，再直接在二分图上跑一个最小费用最大流即可。

-------------

====== Comments ======

ptw:

  * 抢榆枋而止

Gary:

  * C题思路上有问题，平常都是类似题解的方式讨论，今天脑子抽了
  * 在一次提醒自己写板子

Withinlover:

  * 注 意 肠 道 卫 生 
  * 现在看E题挺显然的不知道自己当时在懵啥（
CVBB ACM Team

用户工具

站点工具

页面工具
