Submission #1839088


Source Code Expand

from operator import mul

n, m = map(int, input().split())
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))

dXs = [0] * (n - 1)
for i in range(n - 1):
    dXs[i] = xs[i + 1] - xs[i]

dYs = [0] * (m - 1)
for j in range(m - 1):
    dYs[j] = ys[j + 1] - ys[j]

fXs = [(i + 1) * (n - i - 1) for i in range(n)]
fYs = [(j + 1) * (m - j - 1) for j in range(m)]

MOD = 10 ** 9 + 7
ans = 0
for dY, fY in zip(dYs, fYs):
    ans += dY * fY * sum(map(mul, dXs, fXs))
    ans %= MOD

print(ans)

Submission Info

Submission Time
Task D - ###
User ZollingerPython3
Language Python (3.4.3)
Score 0
Code Size 532 Byte
Status TLE
Exec Time 2105 ms
Memory 29740 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 5
TLE × 12
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, max.txt, min.txt, mod.txt, n2.txt, rndA.txt, rndB.txt, rndC.txt, rndD.txt, rndE.txt, rndF.txt, rndG.txt, rndH.txt, rndI.txt, rndJ.txt, var.txt
Case Name Status Exec Time Memory
0_000.txt AC 20 ms 3064 KB
0_001.txt AC 18 ms 3064 KB
max.txt TLE 2105 ms 20836 KB
min.txt AC 18 ms 3064 KB
mod.txt AC 169 ms 15052 KB
n2.txt AC 89 ms 15052 KB
rndA.txt TLE 2105 ms 27664 KB
rndB.txt TLE 2104 ms 29084 KB
rndC.txt TLE 2105 ms 27032 KB
rndD.txt TLE 2105 ms 27672 KB
rndE.txt TLE 2105 ms 27032 KB
rndF.txt TLE 2104 ms 29740 KB
rndG.txt TLE 2105 ms 27032 KB
rndH.txt TLE 2105 ms 27032 KB
rndI.txt TLE 2105 ms 27032 KB
rndJ.txt TLE 2105 ms 27664 KB
var.txt TLE 2104 ms 25908 KB