### moscow01's blog

By moscow01, history, 9 months ago,

What's the intended time complexity for E? Can it be solve in O(nk)?

• +18

 » 9 months ago, # |   +11 What is test 7 in problem M?
•  » » 9 months ago, # ^ |   +19 We had WA7. Our problem was too many executions on test a...aSb (98 A's)
•  » » » 9 months ago, # ^ |   0 We only executes 198 instructions on aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaSb, but still can't pass test 7.Is it correct that iterating through the instruction set (i.e. execution step 2) doesn't counted as instruction executed?
•  » » » » 9 months ago, # ^ |   +5 As far as I undersatnd the whole loop is counted as one executed instruction (i.e find first instruction that matches and run it)
 » 9 months ago, # |   +19 For E we have a $O(nk \log n)$ D&C solution. We thought the TL is a bit too strict for it, but it passed in 1.237s anyway...
•  » » 9 months ago, # ^ | ← Rev. 2 →   +8 Btw why did you solve so long problem H? :)
•  » » » 9 months ago, # ^ |   +19 We played the contest in the Pre-Finals camp, and we just didn't open problem H before ~ 3:00. Kind of weird that during the Pre-Finals camp, no one submitted H before us, so we thought I and K are easier :(
 » 9 months ago, # |   +49 This contest is prepared by Zhejiang University, a selection from the 19th Zhejiang Provincial Collegiate Programming Contest and 2022 Zhejiang University of Technology Programming Contest. The problem setter might upload all of these contests into Gym recently. And they also prepare the editorial for pre-final camp, which will also be uploaded.I also received some questions (or even complaint?) about this contest. But note that I didn't even send an announcement this time since I know nothing about this contest...