Submission #2532570

Source Code Expand

import bisect
def inpl(): return list(map(int, input().split()))
N = int(input())
a, b, c = sorted(inpl()), sorted(inpl()), sorted(inpl())
print(a)
print(b)
print(c)
ans = 0
for j in b:
    ans += bisect.bisect_left(a, j)*(N-bisect.bisect_right(c, j))
print(ans)

Submission Info

Submission Time
Task C - Snuke Festival
User eagle_i
Language Python (3.4.3)
Score 0
Code Size 272 Byte
Status WA
Exec Time 357 ms
Memory 24528 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
WA × 3
WA × 32
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt WA 351 ms 23292 KB
02.txt WA 350 ms 23292 KB
03.txt WA 342 ms 21904 KB
04.txt WA 338 ms 21904 KB
05.txt WA 295 ms 19224 KB
06.txt WA 296 ms 19232 KB
07.txt WA 247 ms 12068 KB
08.txt WA 255 ms 12192 KB
09.txt WA 219 ms 8024 KB
10.txt WA 219 ms 8036 KB
11.txt WA 194 ms 7416 KB
12.txt WA 193 ms 7416 KB
13.txt WA 342 ms 22992 KB
14.txt WA 340 ms 22996 KB
15.txt WA 340 ms 22744 KB
16.txt WA 343 ms 22752 KB
17.txt WA 339 ms 23060 KB
18.txt WA 341 ms 23060 KB
19.txt WA 357 ms 23264 KB
20.txt WA 183 ms 7416 KB
21.txt WA 171 ms 7416 KB
22.txt WA 220 ms 24528 KB
23.txt WA 332 ms 22896 KB
24.txt WA 334 ms 22712 KB
25.txt WA 333 ms 22284 KB
26.txt WA 17 ms 3060 KB
27.txt WA 17 ms 3060 KB
28.txt WA 17 ms 3064 KB
29.txt WA 17 ms 3064 KB
s1.txt WA 17 ms 3060 KB
s2.txt WA 17 ms 3060 KB
s3.txt WA 17 ms 3060 KB