Difference between revisions of "2019 ICPC World Finals"

From EOJ Wiki
Jump to navigation Jump to search
Line 4: Line 4:
  
 
Solved by ultmaster. 01:07 (+1)
 
Solved by ultmaster. 01:07 (+1)
 +
 +
题意:给两排物品,每个物品分别有高度和价格两个属性。要求给两排物品分别做排列,使得同一列上后面的物品比前面的物品高;同一行上价格单增。
 +
 +
题解:盲人签到,上来就 WA。还得靠队友拯救。对价格排完序后,切成一段一段,然后从左往右加进去,少的那段在多的那段里面贪心找。代码倍增,没出锅已经很好了。
  
 
== Problem B ==
 
== Problem B ==

Revision as of 07:14, 5 April 2019

Replay

Problem A

Solved by ultmaster. 01:07 (+1)

题意:给两排物品,每个物品分别有高度和价格两个属性。要求给两排物品分别做排列,使得同一列上后面的物品比前面的物品高;同一行上价格单增。

题解:盲人签到,上来就 WA。还得靠队友拯救。对价格排完序后,切成一段一段,然后从左往右加进去,少的那段在多的那段里面贪心找。代码倍增,没出锅已经很好了。

Problem B

看完口胡了一下觉得有点难写,就扔了。

Problem C

没看过。

Problem D

Solved by ultmaster. 03:36 (+3)

Problem E

Solved by zerol. 01:49 (+1)

Problem F

Unsolved.

Problem G

Unsolved. (-10)

Problem H

Solved by kblack. 03:49 (+3)

Problem I

没看过。

Problem J

Solved by zerol. 04:09 (+8)

Problem K

Unsolved.