提出 #71319693

---

ソースコード 拡げる

def main():
    N = int(input())
    clouds = [list(map(int, input().split())) for _ in range(N)]

    field = [[0] * 2001 for _ in range(2001)]

    for u, d, l, r in clouds:
        u -= 1
        d -= 1
        l -= 1
        r -= 1
        field[u][l] += 1
        field[u][r+1] -= 1
        field[d+1][l] -= 1
        field[d+1][r+1] +=1
    
    for y in range(2000):
        t = 0
        for x in range(2000):
            t += field[y][x]
            field[y][x] = t
    
    for x in range(2000):
        t = 0
        for y in range(2000):
            t += field[y][x]
            field[y][x] = t

    zeros = 0
    ones = [[0] * 2001 for _ in range(2001)]

    for y in range(2000):
        for x in range(2000):
            if field[y][x] == 0:
                zeros += 1
            if field[y][x] == 1:
                ones[y][x] += 1
    
    for y in range(2000):
        t = 0
        for x in range(2000):
            t += ones[y][x]
            ones[y][x] = t
    
    for x in range(2000):
        t = 0
        for y in range(2000):
            t += ones[y][x]
            ones[y][x] = t
    
    def count_ones(u, d, l, r):
        total = ones[d][r]
        um = ones[u-1][r]
        ul = ones[d][l-1]
        uu = ones[u-1][l-1]
        return total - um - ul + uu

    for u, d, l, r in clouds:
        u -= 1
        d -= 1
        l -= 1
        r -= 1
        print(zeros + count_ones(u, d, l, r))

main()

提出情報

ジャッジ結果