houses, all equally spaced apart. Each house either has the lights on or off. rates a house with a score equal to the minimum distance, in house units, that he must travel to be at a house that has its lights on.
lives on a street withwants to compute the sum of the ratings of all the houses on his street.
Constraints
In tests worth 5 marks, .
At least one house will always have its lights on.
Input Specification
The first line contains a single positive integer, .
The next line contains a binary string. If the th character of the string is 1
, then the th house has its lights on. Otherwise, the th character of the string is 0
and that house has its lights off.
Output Specification
Output the sum of all the ratings.
Sample Input 1
3
111
Sample Output 1
0
Explanation for Sample 1
Every house is illuminated, so every house has a rating of 0.
Sample Input 2
4
1001
Sample Output 2
2
Explanation for Sample 2
The first and last house have ratings of 0, and the second and third house each have a rating of 1.
Comments
Help me! check my code pls
Can someone check my code and see why my algorithm isn't working for test case 12? It worked for all of the test cases I've tried myself.
I'm getting case 12 wrong, but I'm not sure what the issue with my algorithm is. Can someone please advise?
You most likely misunderstood the question, reread the question.
Can someone tell me what to do..?
Please?
#Confusion
As for all problems, read the problem carefully and try and construct a solution. If you're stuck, there's an editorial explaining this question that you can access right above "Points:5 (partial)".
For future reference, it usually isn't wise to ask for help on a question in the comments without trying to code it first. Asking for help with specific parts of the problem or parts of your code is fine, but don't ask the comments how to do an entire question. If you need to ask someone this type of question, the DMOJ discord is a better place to do it. Hope this helps!