Python解数学题

题目如下：

求题的解法和代码，要求节省时间和空间，最好不要引入外部库

其实就是两个正方形面积之和减去相交的面积

a,b,v1,c,d,v2 = map(int,input().split())
a2 = a+v1
b2 = b-v1
c2 = c+v2
d2 = d-v2
intersect = 0
if c<a2 and c2>a and d>b2 and d2<b:
    m = max(min(c,a2),min(a,c2))
    n = min(max(d,b2),max(b,d2))
    m2 = min(max(c,a2),max(a,c2))
    n2 = max(min(d,b2),min(b,d2))
    intersect = (m2-m)*(n-n2)
print(v1*v1+v2*v2-intersect)