## Mock CCC '20 Contest 1 J4 - A Binary Problem

View as PDF

Points: 5 (partial)
Time limit: 1.0s
Memory limit: 1G

Problem type

koosaga lives on a street with houses, all equally spaced apart. Each house either has the lights on or off. koosaga 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.

koosaga wants 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.

3
111

0

#### Explanation for Sample 1

Every house is illuminated, so every house has a rating of 0.

4
1001

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.

• commented on Dec. 14, 2023, 1:26 a.m.

Help me! check my code pls

• commented on March 24, 2022, 8:38 p.m.

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.

• commented on Feb. 3, 2021, 9:53 p.m. edited

I'm getting case 12 wrong, but I'm not sure what the issue with my algorithm is. Can someone please advise?

• commented on Feb. 18, 2021, 5:25 p.m. edited

You most likely misunderstood the question, reread the question.

• commented on Aug. 14, 2020, 2:20 p.m. edit 2

Can someone tell me what to do..?