Submission #7501769
Source Code Expand
import numpy as np n = int(input()) arr = np.zeros(1000000+2, dtype=np.int32) a,b = [],[] for _ in range(n): aa,bb = map(int,input().split()) a.append(aa) b.append(bb) for i in range(n): arr[a[i]] += 1 arr[b[i]+1] -= 1 ans = arr.cumsum().max() print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | hoimy |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 300 Byte |
Status | AC |
Exec Time | 1680 ms |
Memory | 39612 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt |
Subtask2 | subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 159 ms | 27976 KB |
subtask0_sample02.txt | AC | 159 ms | 28104 KB |
subtask1_01.txt | AC | 159 ms | 27976 KB |
subtask1_02.txt | AC | 158 ms | 27976 KB |
subtask1_03.txt | AC | 187 ms | 28104 KB |
subtask1_04.txt | AC | 189 ms | 28104 KB |
subtask1_05.txt | AC | 187 ms | 28104 KB |
subtask1_06.txt | AC | 188 ms | 28104 KB |
subtask1_07.txt | AC | 187 ms | 28104 KB |
subtask1_08.txt | AC | 189 ms | 31944 KB |
subtask1_09.txt | AC | 188 ms | 31944 KB |
subtask1_10.txt | AC | 189 ms | 31944 KB |
subtask1_11.txt | AC | 189 ms | 31944 KB |
subtask1_12.txt | AC | 189 ms | 31944 KB |
subtask1_13.txt | AC | 190 ms | 31940 KB |
subtask1_14.txt | AC | 188 ms | 31944 KB |
subtask1_15.txt | AC | 190 ms | 31940 KB |
subtask2_01.txt | AC | 1641 ms | 32540 KB |
subtask2_02.txt | AC | 1552 ms | 37852 KB |
subtask2_03.txt | AC | 1648 ms | 32896 KB |
subtask2_04.txt | AC | 1659 ms | 36484 KB |
subtask2_05.txt | AC | 1656 ms | 36096 KB |
subtask2_06.txt | AC | 1660 ms | 39612 KB |
subtask2_07.txt | AC | 1526 ms | 39580 KB |
subtask2_08.txt | AC | 1540 ms | 39556 KB |
subtask2_09.txt | AC | 1680 ms | 39480 KB |
subtask2_10.txt | AC | 1534 ms | 39576 KB |
subtask2_11.txt | AC | 1679 ms | 39556 KB |
subtask2_12.txt | AC | 1611 ms | 39428 KB |
subtask2_13.txt | AC | 1589 ms | 39584 KB |
subtask2_14.txt | AC | 1556 ms | 39552 KB |
subtask2_15.txt | AC | 1569 ms | 39556 KB |
subtask2_16.txt | AC | 1573 ms | 39556 KB |
subtask2_17.txt | AC | 1605 ms | 39580 KB |
subtask2_18.txt | AC | 1581 ms | 39556 KB |
subtask2_19.txt | AC | 1613 ms | 39548 KB |
subtask2_20.txt | AC | 1566 ms | 39552 KB |
subtask2_21.txt | AC | 1592 ms | 39548 KB |
subtask2_22.txt | AC | 1585 ms | 39572 KB |
subtask2_23.txt | AC | 1656 ms | 39572 KB |
subtask2_24.txt | AC | 1650 ms | 39556 KB |
subtask2_25.txt | AC | 1546 ms | 39584 KB |