144 teams scored 2700 points on this task, for a maximum score of 100, an average score of 19 and a median score of 5.
George is very passionate about the good old times, so much that he switched the illumination in his street to old-fashioned oil lanterns. The street is now nicely illuminated by a sequence of N equally spaced lanterns, providing joy and delight to the whole neighbourhood. However, he got the permission for doing so only by accepting to personally maintain the lanterns lit up: in fact, he has to ensure that given any subsequence of consecutive M lanterns, at least K of them are lit up at any given time. Tonight an heavy storm is coming down on George's neighbourhood, and some particularly strong wind gusts just extinguished part of the lanterns. George can see for each lantern i whether it is lit (L_i = 1) or not (L_i = 0). Since he doesn't want to risk his concession to be revoked, it is time to get out in the storm and turn on some lights! Help George not to freeze in the storm...