888B - Buggy Robot - CodeForces Solution


greedy *1000

Please click on ads to support us..

Python Code:

def solve():
    n = int(input().strip())
    arr = input().split()[0]
    up_down = 0
    left_right = 0
    
    for i in range(0,n):
        if arr[i] == 'U':
            up_down += 1
        elif arr[i] == 'D':
            up_down -= 1
        elif arr[i] == 'L':
            left_right += 1
        elif arr[i] == 'R':
            left_right -= 1
        else:
            continue

    print(n-abs(up_down)-abs(left_right))

solve()


Comments

Submit
0 Comments
More Questions

1523B - Lord of the Values
1406C - Link Cut Centroids
2409. Count Days Spent Together
2410. Maximum Matching of Players With Trainers
1604C - Di-visible Confusion
997A - Convert to Ones
218A - Mountain Scenery
486B - OR in Matrix
1405A - Permutation Forgery
1733A - Consecutive Sum
1733B - Rule of League
1733C - Parity Shuffle Sorting
1264A - Beautiful Regional Contest
1695A - Subrectangle Guess
467B - Fedor and New Game
252C - Points on Line
735C - Tennis Championship
992A - Nastya and an Array
554A - Kyoya and Photobooks
79B - Colorful Field
265B - Roadside Trees (Simplified Edition)
1362C - Johnny and Another Rating Drop
1214C - Bad Sequence
1091B - New Year and the Treasure Geolocation
244A - Dividing Orange
1061C - Multiplicity
1312A - Two Regular Polygons
801A - Vicious Keyboard
510B - Fox And Two Dots
616D - Longest k-Good Segment