Submission #3631059
Source Code Expand
n = int(input()) imos = [0]*(1000001) for i in range(n): l, r = map(int, input().split()) imos[l] += 1 if not r+1 == 1000001: imos[r+1] -= 1 for i in range(1, len(imos)): imos[i] += imos[i-1] print(max(imos))
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | turner |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 239 Byte |
Status | AC |
Exec Time | 578 ms |
Memory | 44532 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 | 210 ms | 10868 KB |
subtask0_sample02.txt | AC | 209 ms | 10868 KB |
subtask1_01.txt | AC | 212 ms | 10868 KB |
subtask1_02.txt | AC | 213 ms | 10868 KB |
subtask1_03.txt | AC | 246 ms | 42612 KB |
subtask1_04.txt | AC | 246 ms | 42484 KB |
subtask1_05.txt | AC | 251 ms | 42484 KB |
subtask1_06.txt | AC | 249 ms | 42484 KB |
subtask1_07.txt | AC | 218 ms | 10868 KB |
subtask1_08.txt | AC | 244 ms | 38260 KB |
subtask1_09.txt | AC | 244 ms | 38388 KB |
subtask1_10.txt | AC | 243 ms | 38132 KB |
subtask1_11.txt | AC | 256 ms | 38388 KB |
subtask1_12.txt | AC | 247 ms | 38004 KB |
subtask1_13.txt | AC | 257 ms | 38260 KB |
subtask1_14.txt | AC | 244 ms | 37748 KB |
subtask1_15.txt | AC | 248 ms | 38260 KB |
subtask2_01.txt | AC | 531 ms | 42612 KB |
subtask2_02.txt | AC | 520 ms | 42484 KB |
subtask2_03.txt | AC | 545 ms | 42612 KB |
subtask2_04.txt | AC | 559 ms | 42484 KB |
subtask2_05.txt | AC | 521 ms | 10868 KB |
subtask2_06.txt | AC | 578 ms | 42484 KB |
subtask2_07.txt | AC | 574 ms | 42484 KB |
subtask2_08.txt | AC | 556 ms | 42484 KB |
subtask2_09.txt | AC | 560 ms | 42484 KB |
subtask2_10.txt | AC | 552 ms | 42484 KB |
subtask2_11.txt | AC | 562 ms | 42484 KB |
subtask2_12.txt | AC | 547 ms | 42484 KB |
subtask2_13.txt | AC | 538 ms | 42484 KB |
subtask2_14.txt | AC | 565 ms | 42484 KB |
subtask2_15.txt | AC | 554 ms | 42484 KB |
subtask2_16.txt | AC | 574 ms | 42484 KB |
subtask2_17.txt | AC | 576 ms | 44532 KB |
subtask2_18.txt | AC | 547 ms | 42484 KB |
subtask2_19.txt | AC | 563 ms | 42484 KB |
subtask2_20.txt | AC | 541 ms | 42484 KB |
subtask2_21.txt | AC | 539 ms | 42484 KB |
subtask2_22.txt | AC | 558 ms | 42484 KB |
subtask2_23.txt | AC | 551 ms | 42484 KB |
subtask2_24.txt | AC | 568 ms | 42484 KB |
subtask2_25.txt | AC | 546 ms | 42484 KB |