Submission #1294456
Source Code Expand
import itertools def main(): n, m = map(int, input().split()) X = list(map(int, input().split())) Y = list(map(int, input().split())) s = 0 for x in itertools.combinations(X, 2): for y in itertools.combinations(Y, 2): x_len = x[0] - x[1] y_len = y[0] - y[1] s += x_len * y_len print(s % (10 ** 9 + 7)) if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | D - ### |
User | sira |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 436 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 18396 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 17 ms | 3060 KB |
0_001.txt | AC | 17 ms | 3060 KB |
max.txt | TLE | 2104 ms | 18396 KB |
min.txt | AC | 17 ms | 3064 KB |
mod.txt | TLE | 2104 ms | 14212 KB |
n2.txt | TLE | 2104 ms | 14212 KB |
rndA.txt | TLE | 2104 ms | 18320 KB |
rndB.txt | TLE | 2104 ms | 18320 KB |
rndC.txt | TLE | 2104 ms | 18316 KB |
rndD.txt | TLE | 2104 ms | 18320 KB |
rndE.txt | TLE | 2104 ms | 18320 KB |
rndF.txt | TLE | 2104 ms | 18320 KB |
rndG.txt | TLE | 2104 ms | 18320 KB |
rndH.txt | TLE | 2104 ms | 18320 KB |
rndI.txt | TLE | 2104 ms | 18320 KB |
rndJ.txt | TLE | 2104 ms | 18316 KB |
var.txt | TLE | 2104 ms | 18376 KB |