2018-2019 ICPC, NEERC, Northern Eurasia Finals

From EOJ Wiki
Revision as of 11:28, 5 December 2018 by Kblack (talk | contribs) (→‎Problem M)
Jump to navigation Jump to search

今天训练了大家的演技。

Problem A

Solved by zerol & kblack. 04:31 (+5)

Problem E

Solved by ultmaster. 01:27 (+)

Problem F

Solved by zerol. 00:53 (+)

Problem G

Solved by zerol. 00:18 (+)

Problem J

Unsolved. (-1)

Problem K

Solved by kblack. 02:42 (+3)

Problem L

Solved by ultmaster. 00:25 (+)

Problem M

Solved by kblack. 00:48 (+)

题意:要你造一个简单 MC 地图,使得若干点对之间的可达性与指定图相同。

题解:使用 $(3n-2) \times 3$ 的截面,底部挖 $n$ 个相距洞代表 $n$ 个点,对于原图的每一条边,用一个沟道在第三层进行单向沟通,没了。