제출 #897981

#제출 시각아이디문제언어결과실행 시간메모리
897981shrek27Spiral (BOI16_spiral)Cpython 3
15 / 100
1555 ms3164 KiB
def number(x, y): if x == y and x >= 0: num = 1 + (2 * x - 1) * 2 * x elif x == y and x < 0: x = abs(x) num = 1 + (2 * x + 1) * 2 * x elif y == -x and x < 0: x = abs(x) num = 1 + 4 * x ** 2 elif y == -x + 1 and x >=1: num = 1 + (2 * x ** 2 - 1) elif y > x and y > -x: num = number(y, y) + y - x elif y < x and y > -x + 1: num = number(x, x) + y - x elif y < -x + 1 and y < x: num = number(y, y) + x - y elif y < -x and y > x: num = number(x, x) + x - y return num def intersection(x1, y1, x2, y2): pass def func(x1, y1, x2, y2): count = 0 for x in range(x1, x2 + 1): if x <= 0: a = min(-x, y2) b = max(x, y1) if x > 0: a = min(x, y2) b = max(-x + 1, y1) if a >= b: a = number(x, a) b = number(x, b) count += (a + b) * (a - b + 1) // 2 count = count % (10 ** 9 + 7) for y in range(y1, y2 + 1): if y <= 0: a = max(x1, y + 1) b = min(x2, -y) if y > 0: a = max(x1, -y + 1) b = min(x2, y - 1) if a <= b: a = number(a, y) b = number(b, y) count += (a + b) * (b - a + 1) // 2 count = count % (10 ** 9 + 7) return count n, q = input().split(' ') n, q = int(n), int(q) for i in range(q): x = input() x1, y1, x2, y2 = x.split(' ') x1, y1, x2, y2 = int(x1), int(y1), int(x2), int(y2) ar = func(x1, y1, x2, y2) print(ar)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...