2019 ICPC Nanchang Onsite

Problem A

Unsolved.

Problem B

Solved by Kilo_5723. 04:57 (+2)

Problem C

Solved by Weaver_zhu. 01:05 (+)

Problem D

Unsolved.

Problem E

Solved by Xiejiadong. 00:48 (+)

题意：图中有白边和黑边，至多只能选 $k$ 条白边，求使得所有图联通的最大权值。

题解：因为边的权值都是非负的。所以黑边全部连上。

然后要权值最大，所以默认白边权值大的在前，做一次最小生成树，看是否能够用 $\le k$ 条边联通图。

如果不可以或者无法使得图联通，显然无解。

如果还可以继续加白边，肯定根据权值从大到小将未加入的边加入。

Problem F

Unsolved.

Problem G

Solved by Kilo_5723 && Xiejiadong. 01:19 (+)

Problem H

Unsolved.

Problem I

Unsolved.

Problem J

Unsolved.

Problem K

Solved by Xiejiadong. 03:03 (+)

Problem L

Solved by Kilo_5723. 00:25 (+2)

Problem M

Unsolved. (-6)