Submission #22777524

---

Source Code Expand

import sys
import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def main(A, B, C):
    INF = 1 << 60
    A.sort()
    B.sort()
    C.sort()
    while len(A) % 2 == 1:
        A, B, C = B, C, A

    if len(B) % 2 == 0:
        return 0
    """偶奇奇パターンに帰着できた"""
    def calc(A, B):
        # AB距離の最小値
        if len(A) == 0:
            return INF
        RID = np.searchsorted(A, B)
        LID = RID - 1
        RID[RID == len(A)] -= 1
        LID[LID == -1] = 0
        return np.minimum(np.abs(A[RID] - B), np.abs(A[LID] - B)).min()

    ans = calc(B, C)
    ans = min(ans, calc(A, B) + calc(A, C))
    return ans

stdin = read().replace(b'R', b'0').replace(b'G', b'1').replace(b'B', b'2')
data = np.array(stdin.split(), np.int64)[1:]
num, col = data[::2], data[1::2]
A = num[col == 0]
B = num[col == 1]
C = num[col == 2]

print(main(A, B, C))

Submission Info

Judge Result