ACM-ICPC 2018 Beijing Online Contest

ECNU Foreigners

ultmaster: 感觉去年现场赛，也是这个风格吧。。。所以今年，不去北大了啊。。。

Problem A

Solved by ultmaster. 01:25 (+)

题意：复杂得一批。

题解：最多只能携带五个氧气瓶可以把氧气瓶个数记在状态里。加速药丸必须要在出这个格子的时候用掉（反正早用晚用都一样）。然后会产生不同权的边，所以要使用 Dijkstra 而不是 BFS。

Problem B

Solved by zerol. 00:45 (+)

Problem C

Unsolved. (-3)

ultmaster: 这题目出得真好！给验题人点赞！

做这个题不但不会给我带来任何好处，而且会增大我的工作量呢。。。所以我为什么要做这个题呢？

Problem D

Solved by kblack. 00:23 (+)

Problem H

Solved by kblack. 02:37 (+2)

One,Two,Three,AK

Xiejiadong：久违的自闭场。

Problem A

Solved by Xiejiadong. 1:32:22 (+)

Problem B

Solved by dreamcloud. 1:02:57 (+)

Problem C

Unsolved. (-8)

Problem D

Solved by Xiejiadong. 1:04:45 (+)

Problem G

Unsolved. (-23)

Problem H

Solved by oxx1108. 3:20:27 (+2)