Difference between revisions of "ICPC 2019 Shenyang Online Contest"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
| Line 10: | Line 10: | ||
Solved by Xiejiadong. 00:25 (+1) | Solved by Xiejiadong. 00:25 (+1) | ||
| + | |||
| + | 题意：完全背包，求价值 $\ge m$ 的时候需要的最小代价。 | ||
| + | |||
| + | 题解：可以发现，价值最大只需要 $m+max{v_i}$ ，所以只需要记录最多 $20000$ 的状态。 | ||
| + | |||
| + | 完全背包，暴力转移即可。 | ||
== Problem D == | == Problem D == | ||
Revision as of 10:40, 14 September 2019
Problem A
Unsolved.
Problem B
Solved by Xiejiadong. 02:32 (+1)
Problem C
Solved by Xiejiadong. 00:25 (+1)
题意：完全背包，求价值 $\ge m$ 的时候需要的最小代价。
题解：可以发现，价值最大只需要 $m+max{v_i}$ ，所以只需要记录最多 $20000$ 的状态。
完全背包，暴力转移即可。
Problem D
Solved by Weaver_zhu. 01:46 (+1)
Problem E
Unsolved.
Problem F
Solved by Kilo_5723. 00:17 (+)
Problem G
Solved by Kilo_5723. 03:30 (+2)
Problem H
Solved by Xiejiadong. 01:23 (+1)
题意：给出每个人持有的扑克牌，按照德州扑克的顺序排列。
题解：大模拟，按照题意写就完事了。
Problem I
Unsolved.
Problem J
Solved by Kilo_5723. 04:51 (+1)
Problem K
Solved by Kilo_5723. 02:42 (+2)