2018 Multi-University, Nowcoder Day 4

Problem A

Solved by zerol. 02:17 (+2)

Problem C

Solved by ultmaster. 02:57 (+1)

Problem D

Solved by zerol. 01:19 (+1)

Problem E

Upsolved by kblack.

Problem F

Solved by ultmaster. 00:37 (+)

Problem G

Solved by kblack. 00:39 (+)

Problem J

Solved by kblack. 04:05 (+8)

题意：naive 的 hash 函数，naive 的解决方法（往后放），给出结果，求字典序最小的原插入顺序。

题解：很明显的拓扑排序，原题解是线段树优化。也可以考察特殊条件，所有相交的区间合并，包含的区间只会被跳一次，瞎几把搞一搞就好了，注意无解的判断即可。