TYLER AND THE FAIR SOLUTIONS BVPCSI02

TYLER AND THE FAIR SOLUTIONS BVPCSI02

Two neighboring states chose to construct a divider between them with certain doors to empower the residents to move between different states. Each time a resident goes through an entryway, he needs to pay one silver coin. 

The guide of the states can be spoken to by the primary quadrant of a plane and the divider is worked along the character line (for example the line with the condition x = y). Any point underneath the divider has a place with the primary state while any point over the divider has a place with the subsequent state. There is a door at any whole number point on the line (i.e.atpoints(0, 0),(1, 1),(2, 2),…). The divider and the entryways don’t have a place with any of the states. Tyler is at the door at position (0, 0) and he needs to stroll around in the two states. He knows the grouping S of moves he will do. This arrangement is where each character speaks to a move. The two potential moves Tyler will do are ′U′ (move one stage up, from (x, y)to(x, y + 1)) and ′R′ (move one stage right, from (x, y)to(x + 1, y)). Tyler needs to know the quantity of silver coins he needs to pay to stroll around the two states following the grouping S. Note that if Tyler visits a door without moving starting with one state then onto the next, hepaysnosilvercoins. Likewise accept that he doesn’t pay at the entryway at point (0, 0), for example he is at first as an afterthought he needs. 

 

Info: 

The main line of the information contains single whole number n — the quantity of moves in the strolling succession. 

The subsequent line contains a string S of length n comprising of the characters ′U′ and ′R′ depicting the necessary moves. Tyler will follow the succession S all together from left to right. 

Yield:On a solitary line, print one number speaking to the quantity of silver coins Tyler needs to pay at the entryways to follow the arrangement S. 

 

Imperatives: 

(1 ≤ n ≤ 105) 

 

Test input 

Test yield 

 

Test input 

RURUUR 

Test yield 

 

Test input 

URRRUUU 

Test yield 

 

Clarification: 

The figure beneath portrays the third example. The red bolts speak to the succession of moves Tyler will follow. The green entryways speak to the doors at which Tyler need to pay silver coins.

Solution

CODE PYTHON 3.6 :

 

n = int(input())

s = [str(x) for x in input() ]

up = 0

right = 0

count = -1

k = 0

for x in s:

    if x==’U’:

        up+=1

    if x==’R’:

        right+=1

    if up<right and (k==1 or k==0):

        count+=1

        k=2

    if right<up and (k==2 or k==0):

        count+=1

        k=1

 

print(count)

 

 

March Long Challenge 2021 Solutions

April Long Challenge 2021 Solutions

Codechef Long Challenge Solutions

February Long Challenge 2021

1. Frog Sort Solution Codechef

2. Chef and Meetings Solution Codechef

3. Maximise Function Solution Codechef

4. Highest Divisor Solution Codechef

5. Cut the Cake Challenge Solution Codechef

6. Dream and the Multiverse Solution Codechef

7. Cell Shell Solution Codechef

8. Multiple Games Solution Codechef

9. Another Tree with Number Theory Solution Codechef

10. XOR Sums Solution Codechef

11. Prime Game Solution CodeChef

12. Team Name Solution Codechef

January Long Challenge 2021

November Challenge 2020 SOLUTION CodeChef

October Lunchtime 2020 CodeChef SOLUTIONS

RELATED :

Related :

Related :

Leave a Comment

close
error: Content is protected !!