标签：期望   网络   枚举   sig   时间复杂度   track   复杂   with   character   

O: 当场通过

?: 赛后通过

.: 尚未通过

A Hard to prepare

solved by chelly

chelly‘s solution

B BE, GE or NE

solved by ch

ch‘s solution

C Cacti Lottery

upsolved by chelly

chelly‘s solution

考虑枚举*代表的数字，对于每种情况，再枚举#代表的数字，算出每种决策的期望，选个最大的

D Easy Math

upsolved by chelly

chelly‘s solution

推一下式子，发现之后就是一个类似杜教筛复杂度的降规模，时间复杂度就足够过了。

E End Fantasy VIX

unsolved

F Features Track

solved by chelly

chelly‘s solution

G Trace

solved by chelly

chelly‘s solution

H Ryuji doesn‘t want to study

solved by ch

ch‘s solution

I Characters with Hash

solved by chelly

chelly‘s solution

J Maze Designer

solved by chell&ch

chelly‘s solution

K Morgana Net

upsolved by ch

ch‘s solution

Replay

ACM-ICPC 2018 徐州赛区网络预赛

标签：期望   网络   枚举   sig   时间复杂度   track   复杂   with   character   

原文地址：https://www.cnblogs.com/Amadeus/p/9615513.html