Submission #4269293

Source Code Expand

n = int(input())
info = [list(map(int,input().split())) for i in range(n)]

question=[0]*(1000000+2)

for i in range(n):
  question[info[i][0]] += 1
  question[info[i][1]+1] -= 1
  
summation = 0
for i in range(1000000+1):
  question[i+1] = question[i+1] +question[i]

print(max(question))

Submission Info

Submission Time
Task C - AtColor
User neterukun
Language Python (3.4.3)
Score 100
Code Size 302 Byte
Status AC
Exec Time 649 ms
Memory 66868 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 42
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 287 ms 10868 KB
subtask0_sample02.txt AC 266 ms 10868 KB
subtask1_01.txt AC 289 ms 10868 KB
subtask1_02.txt AC 265 ms 10868 KB
subtask1_03.txt AC 285 ms 42884 KB
subtask1_04.txt AC 285 ms 43008 KB
subtask1_05.txt AC 282 ms 42884 KB
subtask1_06.txt AC 310 ms 43008 KB
subtask1_07.txt AC 290 ms 11244 KB
subtask1_08.txt AC 294 ms 38720 KB
subtask1_09.txt AC 281 ms 38848 KB
subtask1_10.txt AC 278 ms 38596 KB
subtask1_11.txt AC 279 ms 38848 KB
subtask1_12.txt AC 279 ms 38468 KB
subtask1_13.txt AC 288 ms 38720 KB
subtask1_14.txt AC 288 ms 38216 KB
subtask1_15.txt AC 285 ms 38720 KB
subtask2_01.txt AC 613 ms 63804 KB
subtask2_02.txt AC 600 ms 66868 KB
subtask2_03.txt AC 588 ms 63804 KB
subtask2_04.txt AC 612 ms 66868 KB
subtask2_05.txt AC 600 ms 35108 KB
subtask2_06.txt AC 632 ms 66812 KB
subtask2_07.txt AC 630 ms 66812 KB
subtask2_08.txt AC 633 ms 66812 KB
subtask2_09.txt AC 629 ms 66812 KB
subtask2_10.txt AC 614 ms 66812 KB
subtask2_11.txt AC 619 ms 66812 KB
subtask2_12.txt AC 614 ms 66812 KB
subtask2_13.txt AC 618 ms 66812 KB
subtask2_14.txt AC 627 ms 66812 KB
subtask2_15.txt AC 627 ms 66812 KB
subtask2_16.txt AC 612 ms 66820 KB
subtask2_17.txt AC 627 ms 66812 KB
subtask2_18.txt AC 639 ms 66812 KB
subtask2_19.txt AC 631 ms 66812 KB
subtask2_20.txt AC 634 ms 66812 KB
subtask2_21.txt AC 642 ms 66812 KB
subtask2_22.txt AC 649 ms 66812 KB
subtask2_23.txt AC 638 ms 66812 KB
subtask2_24.txt AC 614 ms 66812 KB
subtask2_25.txt AC 614 ms 66812 KB