oj.uz

답안 #1111778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111778 2024-11-12T20:33:15 Z Rainmaker2627 Spiral (BOI16_spiral) Python 3
100 / 100
 19 ms 3152 KB 
q=[[[0, -1, 2, 4, 2], [0, 0, 4, 0, 2]], [[0, -4, 10, 0, 2], [0, 1, 2, -4, 2]]]
r=[[[0, 13, 15, 8], [0, 19, -21, 8]], [[0, 19, 21, 8], [0, 13, -15, 8]]]
def p(p, x):
    return sum(p[i]*x**i for i in range(len(p)))

def t(x, y):
    a,b=x,y
    if abs(x)<abs(y): a,b=b,a
    c=p(q[x>=0][y>=0], abs(b))
    d=abs(b)*(p(r[abs(x)<abs(y)][a>=0],abs(a))-p(r[abs(x)<abs(y)][a>=0],abs(b)))//6
    d+=(abs(a)-abs(b))*(abs(b)-(b>=0))*(abs(b)-(b>=0)+1)//2 *(-1 if (abs(x)<abs(y))^(x>=0)^(y>=0) else 1)
    if y<0<x and -y<x: d-=8*y
    return c+d

mod=10**9+7
n,m=map(int, input().split())
for _ in range(m):
    s=0
    a,b,c,d=map(int, input().split())
    x,y=[a,c+1],[b,d+1]
    for i in range(2):
        for j in range(2):
            s+=t(x[i], y[j])*(-1 if x[0]*x[1]>0 and abs(x[i])<abs(x[1-i]) else 1)*(-1 if y[0]*y[1]>0 and abs(y[j])<abs(y[1-j]) else 1)
    print(s%mod)

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 3152 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 3152 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 3152 KB Output is correct
2 Correct 17 ms 3152 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 3152 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 3152 KB Output is correct
2 Correct 16 ms 3152 KB Output is correct
3 Correct 17 ms 3152 KB Output is correct
4 Correct 19 ms 3152 KB Output is correct
5 Correct 16 ms 3152 KB Output is correct