Submission #2695720


Source Code Expand

MOD=10**9+7
n,m=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
x_sum=sum((2*i-n+1)*x[i]for i in range(n))
y_sum=sum((2*i-m+1)*y[i]for i in range(m))
print(x_sum*y_sum%MOD)

Submission Info

Submission Time
Task D - ###
User kyuna
Language Python (3.4.3)
Score 500
Code Size 221 Byte
Status AC
Exec Time 104 ms
Memory 18556 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 17 ms 3064 KB
0_001.txt AC 17 ms 3060 KB
max.txt AC 104 ms 18396 KB
min.txt AC 17 ms 3060 KB
mod.txt AC 62 ms 14468 KB
n2.txt AC 62 ms 14464 KB
rndA.txt AC 103 ms 18556 KB
rndB.txt AC 104 ms 18556 KB
rndC.txt AC 104 ms 18320 KB
rndD.txt AC 104 ms 18316 KB
rndE.txt AC 103 ms 18556 KB
rndF.txt AC 103 ms 18316 KB
rndG.txt AC 103 ms 18556 KB
rndH.txt AC 104 ms 18320 KB
rndI.txt AC 103 ms 18316 KB
rndJ.txt AC 103 ms 18320 KB
var.txt AC 103 ms 18252 KB