五月模拟题

附上Python *** def solution():     n = int(input())     table = [[0]*1001 for _ in range(1001)]     for _ in range(n):         x,y = map(int,input().split())         table[x][y] = 1     for i in range(1,1001):         for j in range(1,1001):             if i>0:                 table[i][j] += table[i][j-1]             if j>0:                 table[i][j] += table[i-1][j]             if i>0 and j>0:                 table[i][j] -= table[i-1][j-1]          m = int(input())     questions = [[int(i) for i in input().split()] for _ in range(m)]     for x1,y1,x2,y2 in questions:         p1 = table[x1-1][y2] if x1 else 0         p2 = table[x2][y1-1] if y1 else 0         p3 = table[x1-1][y1-1] if x1 and y1 else 0         print(table[x2][y2]-p1-p2+p3)                       if __name__ == '__main__':     solution()

我百分之60 ，直接遍历求得

感觉你们说的是第一题😂

1000*1000的boolean数组,60%