Magical Doors solution codechef

Chef wants to cross a hallway of NN doors. These NN doors are represented as a string. Each door is initially either open or close, represented by 11 or 00 respectively. Chef is required to go through all the doors one by one in the order that they appear, starting from the leftmost door and moving only rightwards at each step.

To make the journey easier, Chef has a magic wand, using which Chef can flip the status of all the doors at once. Determine the minimum number of times Chef has to use this wand to cross the hallway of doors.

For example, the doors are 1001110011. Chef will start from the left and enter the first door. After passing through that door, the magic wand is waved. This flips the string to 0110001100. Now Chef passes through the next two doors in one go. Again, just before reaching the 4th door, the magic wand is waved. Now that the string is in its original state, Chef passes through the last two doors as well. The minimum number of times the magic wand needed to be used here was 22.

Magical Doors solution codechef

• First line will contain TT, number of testcases. Then the testcases follow.
• Each testcase contains of a single string SS, representing the doors as given in the problem.

Output Format

For each test case, print a single line containing one integer denoting the minimum number of times the magic wand needs to be used.

Constraints

• 1T1051≤T≤105
• 1|S|1051≤|S|≤105
• Sum of |S||S| over all test cases 2106≤2⋅106

Magical Doors solution codechef

3
111
010
10011


Sample Output 1

0
3
2


Explanation

Magical Doors solution codechef

• Test Case 11: Since all the doors are already open, Chef doesn’t need to use the magic wand at all.
• Test Case 22: Chef will use the wand the first time to open door 11. This operation makes the string “101”. Chef again needs to use the wand to open door 22, and then one last time to open door 33. In total, Chef used the wand 33 times.
• Testcase 33: As explained in the problem statement above