Difference between revisions of "2018 CCPC Qinhuangdao Onsite"
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
Solved by ultmaster. 02:50 (+1) | Solved by ultmaster. 02:50 (+1) | ||
| + | |||
| + | 题意：给一个无向图，每条边加单位容量有一个代价，求在给定代价内能够达到的最小割的最大值。 | ||
| + | |||
| + | 题解：裸的最小费用最大流。如果当次 Bellman Ford 跑出来的流量已经不能全部买到了，那就切一部分买到的。 | ||
| + | |||
| + | 抄模板漏了一个 &，WA +1。 | ||
== Problem B == | == Problem B == | ||
Revision as of 11:28, 28 September 2018
Replay
Problem A
Solved by ultmaster. 02:50 (+1)
题意：给一个无向图，每条边加单位容量有一个代价，求在给定代价内能够达到的最小割的最大值。
题解：裸的最小费用最大流。如果当次 Bellman Ford 跑出来的流量已经不能全部买到了，那就切一部分买到的。
抄模板漏了一个 &，WA +1。
Problem B
Solved by zerol. 00:09 (+)
Problem C
Solved by ultmaster. 01:00 (+2)
Problem D
Solved by kblack. 04:51 (+1)
Problem G
Solved by zerol. 01:58 (+4)
Problem I
Solved by ultmaster. 02:03 (+)
Problem J
Solved by kblack. 00:51 (+)