Submission #2532572

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())

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 300
Code Size 246 Byte
Status AC
Exec Time 328 ms
Memory 22720 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 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 AC 320 ms 22452 KB
02.txt AC 316 ms 22452 KB
03.txt AC 328 ms 21672 KB
04.txt AC 328 ms 21904 KB
05.txt AC 275 ms 19992 KB
06.txt AC 274 ms 19232 KB
07.txt AC 227 ms 12068 KB
08.txt AC 227 ms 12192 KB
09.txt AC 200 ms 7376 KB
10.txt AC 202 ms 7384 KB
11.txt AC 172 ms 6464 KB
12.txt AC 173 ms 7272 KB
13.txt AC 303 ms 22208 KB
14.txt AC 301 ms 22216 KB
15.txt AC 301 ms 22304 KB
16.txt AC 299 ms 22304 KB
17.txt AC 308 ms 22432 KB
18.txt AC 298 ms 22432 KB
19.txt AC 315 ms 22452 KB
20.txt AC 167 ms 7272 KB
21.txt AC 155 ms 7272 KB
22.txt AC 187 ms 22720 KB
23.txt AC 293 ms 22264 KB
24.txt AC 294 ms 22312 KB
25.txt AC 299 ms 22240 KB
26.txt AC 17 ms 3060 KB
27.txt AC 17 ms 3060 KB
28.txt AC 17 ms 3060 KB
29.txt AC 17 ms 2940 KB
s1.txt AC 17 ms 3060 KB
s2.txt AC 17 ms 2940 KB
s3.txt AC 17 ms 3060 KB