Submission #3509036

Source Code Expand

def inpl(): return [int(i) for i in input().split()]
mod = 10**9+7

n, m = inpl()
x = inpl()
y = inpl()
H = [(x[i+1]-x[i])*(i+1)*(n-i-1) % mod for i in range(n-1)]
W = [(y[j+1]-y[j])*(j+1)*(m-j-1) % mod for j in range(m-1)]

print(sum(H)*sum(W) % mod)

Submission Info

Submission Time
Task D - ###
User Tallfall
Language Python (3.4.3)
Score 500
Code Size 260 Byte
Status AC
Exec Time 161 ms
Memory 19648 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 17
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 16 ms 3060 KB
0_001.txt AC 17 ms 3064 KB
max.txt AC 153 ms 19648 KB
min.txt AC 17 ms 3064 KB
mod.txt AC 88 ms 14468 KB
n2.txt AC 87 ms 14468 KB
rndA.txt AC 152 ms 19072 KB
rndB.txt AC 155 ms 19136 KB
rndC.txt AC 161 ms 19112 KB
rndD.txt AC 157 ms 19136 KB
rndE.txt AC 154 ms 19080 KB
rndF.txt AC 154 ms 19120 KB
rndG.txt AC 155 ms 19084 KB
rndH.txt AC 155 ms 19080 KB
rndI.txt AC 158 ms 19072 KB
rndJ.txt AC 155 ms 19136 KB
var.txt AC 154 ms 19092 KB