ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1570. Eating High

Complexity
Posted by Infoshoc 12 Oct 2016 19:42
Solved with O(n * (m+max("filling value")) * 10^3). Anyone better?
Strange thing: seems like in tests 15-16 max("filling value") is good deal smaller than 10.0, because O(n * (m+10) * 10^3) failed.
Re: Complexity
Posted by Harkonnen 9 Aug 2022 23:13
There is 30000*100 solution O(filling X dishes)