Submission #3402236

---

Source Code Expand

def main():
    dir = ("East", "", "West")
    n, a, b = map(int, input().split())

    x = 0
    for i in range(n):
        x += move(a, b, dir)
    output(x, dir)


def output(x, dir):
    print(dir[sign(x) + 1], end="")
    if sign(x) != 0:
        print(" ", end="")
    print(abs(x))


def move(smallest, largest, dir):
    s, tmp = input().split()
    d = int(tmp)

    for i, v in enumerate(dir):
        if s == v:
            return max(smallest, min(largest, d)) * (i - 1)
    return 0


def sign(x):
    if x == 0:
        return 0
    return x // abs(x)


if __name__ == '__main__':
    main()

Submission Info

Judge Result