Submission #8313152

---

Source Code Expand

n = int(input())
l = []
for i in range(2*n):
    c,a = input().split()
    a = int(a)
    if c == "W":
        a += n
    l.append(a)

pos = [1,n,n+1,2*n]

ans = 0
while l:
    cost = []
    if pos[0] <= pos[1]:
        i = l.index(pos[0])
        cost.append((i,i, 0))
        i = l.index(pos[1])
        cost.append((len(l)-i-1,i, 1))
    if pos[2] <= pos[3]:
        i = l.index(pos[2])
        cost.append((i,i, 2))
        i = l.index(pos[3])
        cost.append((len(l)-i-1,i, 3))
    cost.sort()
    c,i,ind = cost[0]
    ans += c
    l.pop(i)
    if ind%2:
        pos[ind] -= 1
    else:
        pos[ind] += 1

print(ans)

Submission Info

Judge Result