Submission #6895551
Source Code Expand
n = int(input()) lst = [0] * (1000010) limit = 0 for i in range(n): a,b = map(int,input().split()) lst[a] += 1 lst[b+1] -= 1 if max(a,b) > limit: limit = max(a,b) imos = [0] * (1000010) for j in range(limit+1): if j == 0: imos[j] = lst[j] else: imos[j] = imos[j-1] + lst[j] print(max(imos))
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | ohnuma |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 357 Byte |
Status | AC |
Exec Time | 732 ms |
Memory | 50420 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 | 52 ms | 18676 KB |
subtask0_sample02.txt | AC | 283 ms | 18676 KB |
subtask1_01.txt | AC | 76 ms | 18676 KB |
subtask1_02.txt | AC | 53 ms | 18676 KB |
subtask1_03.txt | AC | 324 ms | 50420 KB |
subtask1_04.txt | AC | 313 ms | 50292 KB |
subtask1_05.txt | AC | 337 ms | 50292 KB |
subtask1_06.txt | AC | 310 ms | 50292 KB |
subtask1_07.txt | AC | 60 ms | 18676 KB |
subtask1_08.txt | AC | 309 ms | 46068 KB |
subtask1_09.txt | AC | 323 ms | 46196 KB |
subtask1_10.txt | AC | 310 ms | 45940 KB |
subtask1_11.txt | AC | 337 ms | 46196 KB |
subtask1_12.txt | AC | 318 ms | 45940 KB |
subtask1_13.txt | AC | 308 ms | 46068 KB |
subtask1_14.txt | AC | 315 ms | 45556 KB |
subtask1_15.txt | AC | 351 ms | 46068 KB |
subtask2_01.txt | AC | 667 ms | 50420 KB |
subtask2_02.txt | AC | 650 ms | 50420 KB |
subtask2_03.txt | AC | 628 ms | 50420 KB |
subtask2_04.txt | AC | 691 ms | 50292 KB |
subtask2_05.txt | AC | 437 ms | 18676 KB |
subtask2_06.txt | AC | 625 ms | 50292 KB |
subtask2_07.txt | AC | 632 ms | 50292 KB |
subtask2_08.txt | AC | 654 ms | 50292 KB |
subtask2_09.txt | AC | 658 ms | 50292 KB |
subtask2_10.txt | AC | 638 ms | 50292 KB |
subtask2_11.txt | AC | 651 ms | 50292 KB |
subtask2_12.txt | AC | 693 ms | 50292 KB |
subtask2_13.txt | AC | 635 ms | 50292 KB |
subtask2_14.txt | AC | 732 ms | 50292 KB |
subtask2_15.txt | AC | 683 ms | 50292 KB |
subtask2_16.txt | AC | 699 ms | 50292 KB |
subtask2_17.txt | AC | 632 ms | 50292 KB |
subtask2_18.txt | AC | 664 ms | 50292 KB |
subtask2_19.txt | AC | 639 ms | 50292 KB |
subtask2_20.txt | AC | 730 ms | 50292 KB |
subtask2_21.txt | AC | 683 ms | 50292 KB |
subtask2_22.txt | AC | 659 ms | 50292 KB |
subtask2_23.txt | AC | 633 ms | 50292 KB |
subtask2_24.txt | AC | 641 ms | 50292 KB |
subtask2_25.txt | AC | 639 ms | 50420 KB |