Submission #1301042
Source Code Expand
import sys mod = 10**9 + 7 def solve(): n, m = map(int, input().split()) x = [int(i) for i in input().split()] y = [int(i) for i in input().split()] ans = calc_all_section_length_sum(x) ans = (ans * calc_all_section_length_sum(y)) % mod print(ans) def calc_all_section_length_sum(a): n = len(a) res = 0 for i, ai in enumerate(a): res += (ai * (2*i + 1 - n)) % mod res %= mod return res if __name__ == '__main__': solve()
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | nanae |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 513 Byte |
Status | AC |
Exec Time | 150 ms |
Memory | 19648 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | 18 ms | 3064 KB |
0_001.txt | AC | 17 ms | 3064 KB |
max.txt | AC | 149 ms | 19648 KB |
min.txt | AC | 18 ms | 3064 KB |
mod.txt | AC | 83 ms | 14380 KB |
n2.txt | AC | 82 ms | 14380 KB |
rndA.txt | AC | 145 ms | 18556 KB |
rndB.txt | AC | 145 ms | 18356 KB |
rndC.txt | AC | 148 ms | 18556 KB |
rndD.txt | AC | 146 ms | 18356 KB |
rndE.txt | AC | 146 ms | 18356 KB |
rndF.txt | AC | 144 ms | 18556 KB |
rndG.txt | AC | 143 ms | 18556 KB |
rndH.txt | AC | 145 ms | 18556 KB |
rndI.txt | AC | 150 ms | 19460 KB |
rndJ.txt | AC | 144 ms | 18556 KB |
var.txt | AC | 144 ms | 18448 KB |