Submission #55076417

---

Source Code Expand

def count_meetings(N, T, S, X):
    ants = [(X[i], S[i]) for i in range(N)]
    ants.sort()

    left_ants = [x for x, s in ants if s == '0']
    right_ants = [x for x, s in ants if s == '1']

    def binary_search(arr, value):
        low, high = 0, len(arr)
        while low < high:
            mid = (low + high) // 2
            if arr[mid] < value:
                low = mid + 1
            else:
                high = mid
        return low

    count = 0
    for right in right_ants:
        pos = binary_search(left_ants, right)
        if pos < len(left_ants):
            count += len(left_ants) - pos
        pos = binary_search(left_ants, right + 2 * T + 1)
        if pos < len(left_ants):
            count -= len(left_ants) - pos

    return count

N, T = map(int, input().split())
S = input().strip()
X = list(map(int, input().split()))

print(count_meetings(N, T, S, X))

Submission Info

Judge Result