Back to Submissions List

Problem

Total Time (ms)

Max Memory (KiB)

Verdict

Score

132
2500
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0 $N = 1$ 1 / 1
2 0~10 $N \leq 100, \forall 1 \leq i < j \leq N, A_i \neq A_j, B_i \neq B_j$ 9 / 9
3 0~20 $N \leq 1500, \forall 1 \leq i < j \leq N, A_i \neq A_j, B_i \neq B_j$ 30 / 30
4 0~30 $N \leq 2000$ 20 / 20
5 0~40 $N \leq 4000$ 25 / 25
6 0~50 $N \leq 6666$ 15 / 15

Testdata Results

Testdata no. Subtasks Time (ms) Memory (KiB) Verdict Score
0 1 2 3 4 5 6 0 1268 Accepted 100
1 2 3 4 5 6 0 1264 Accepted 100
2 2 3 4 5 6 0 1300 Accepted 100
3 2 3 4 5 6 0 1300 Accepted 100
4 2 3 4 5 6 0 1284 Accepted 100
5 2 3 4 5 6 0 1300 Accepted 100
6 2 3 4 5 6 0 1336 Accepted 100
7 2 3 4 5 6 0 1336 Accepted 100
8 2 3 4 5 6 0 1208 Accepted 100
9 2 3 4 5 6 0 1360 Accepted 100
10 2 3 4 5 6 0 1308 Accepted 100
11 3 4 5 6 0 1548 Accepted 100
12 3 4 5 6 0 1596 Accepted 100
13 3 4 5 6 0 1596 Accepted 100
14 3 4 5 6 0 1536 Accepted 100
15 3 4 5 6 0 1548 Accepted 100
16 3 4 5 6 0 1560 Accepted 100
17 3 4 5 6 0 1584 Accepted 100
18 3 4 5 6 0 1472 Accepted 100
19 3 4 5 6 0 1484 Accepted 100
20 3 4 5 6 0 1584 Accepted 100
21 4 5 6 0 1644 Accepted 100
22 4 5 6 0 1656 Accepted 100
23 4 5 6 0 1688 Accepted 100
24 4 5 6 0 1576 Accepted 100
25 4 5 6 0 1600 Accepted 100
26 4 5 6 0 1596 Accepted 100
27 4 5 6 0 1652 Accepted 100
28 4 5 6 0 1668 Accepted 100
29 4 5 6 0 1656 Accepted 100
30 4 5 6 0 1688 Accepted 100
31 5 6 4 2040 Accepted 100
32 5 6 4 1980 Accepted 100
33 5 6 4 1972 Accepted 100
34 5 6 4 1968 Accepted 100
35 5 6 4 2004 Accepted 100
36 5 6 4 1952 Accepted 100
37 5 6 4 1964 Accepted 100
38 5 6 4 1968 Accepted 100
39 5 6 4 1996 Accepted 100
40 5 6 4 2020 Accepted 100
41 6 12 2444 Accepted 100
42 6 12 2452 Accepted 100
43 6 8 2424 Accepted 100
44 6 8 2404 Accepted 100
45 6 8 2424 Accepted 100
46 6 8 2476 Accepted 100
47 6 12 2452 Accepted 100
48 6 8 2352 Accepted 100
49 6 8 2492 Accepted 100
50 6 8 2500 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
2.56 KB
Back to Top