Submission #34226132

---

Source Code Expand

#!/usr/bin/env python3


def main():
    def meguru(start, target):
        if start > N:
            return None
        left: int = start - 1
        right: int = N
        while abs(left - right) > 1:
            mid = (left + right) // 2
            if cs[mid] - cs[start] >= target:  # isOk()
                right = mid
            else:
                left = mid
        if cs[right] - cs[start] == target:
            if start < right <= N:
                return right
        return None

    def solve():
        for i in range(N - 2):
            x = meguru(i, P)
            if x is not None:
                y = meguru(x, Q)
                if y is not None:
                    z = meguru(y, R)
                    if z is not None:
                        print("Yes")
                        return
        print("No")

    N, P, Q, R = map(int, input().split())
    A = list(map(int, input().split()))
    cs = [0]  # si=[0,i)の和 [a,b)の和=sb−sa 遅かったらnumpy
    for i in A:
        cs.append(cs[-1] + i)
    solve()


if __name__ == "__main__":
    main()

Submission Info

Judge Result