2019 ICPC China Nanchang Invitational Programming Contest

Replay

Xiejiadong:

• 怎么会有中文题面这种操作。

• 怎么会有签到题是 “hello world” 这种操作。

• Weaver_zhu 被巨大套房砸中。于是我又变成了一人间。（准确的说，是三个人都是三人间。

• 被模板砸中。甚至一摸一样。

• 靠一手模板，抢了第一个 Onsite 一血。

• 热身赛当天，大雨磅礴，校园积水。鞋袜湿透。

• 我们那排送气球的 XJJ 好可爱。

Kilo_5723:

Weaver_zhu:

Problem A

Solved by Xiejiadong. 00:45 (+)

题意：求最小边权使得四对点联通。

题解：斯坦纳树模板题。抄就完事了。

Problem B

Unsolved.

Problem C

Solved by Weaver_zhu. 04:51 (+6)

Problem D

Unsolved.

Problem E

Unsolved.

Problem F

Solved by Xiejiadong. 01:14 (+)

Problem G

Solved by Kilo_5723. 01:39 (+)

Problem H

Solved by Xiejiadong && Kilo_5723. 04:16 (+3)

Problem I

Unsolved.

Problem J

Solved by Kilo_5723. 00:57. (+)

Problem K

Solved by Xiejiadong. 00:10 (+)

题意：给出区间，求 $\sum _{i=1}^k k\times \sum_{i=l_i}^{r_i} a_i$ ，可以任意调整 $\sum_{i=l_i}^{r_i} a_i$ ，使得值最大。

题解：贪心。价值大的在后即可。

Problem L

Solved by Xiejiadong. 00:02 (+)

白送的签到。