Submission #4653392
Source Code Expand
n = int(input())
g = [0 for i in range(1000002)]
for i in range(n):
a,b = map(int,input().split())
g[a]+=1
g[b+1]-=1
for i in range(1, 10):
g[i] += g[i-1]
print(max(g))
Submission Info
| Submission Time | |
|---|---|
| Task | C - AtColor |
| User | valusun |
| Language | Python (3.4.3) |
| Score | 0 |
| Code Size | 190 Byte |
| Status | WA |
| Exec Time | 391 ms |
| Memory | 10996 KB |
Judge Result
| Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 76 ms | 10904 KB |
| subtask0_sample02.txt | WA | 76 ms | 10904 KB |
| subtask1_01.txt | AC | 75 ms | 10904 KB |
| subtask1_02.txt | AC | 78 ms | 10904 KB |
| subtask1_03.txt | AC | 80 ms | 10904 KB |
| subtask1_04.txt | WA | 80 ms | 10904 KB |
| subtask1_05.txt | AC | 80 ms | 10904 KB |
| subtask1_06.txt | WA | 80 ms | 10904 KB |
| subtask1_07.txt | AC | 81 ms | 10928 KB |
| subtask1_08.txt | WA | 80 ms | 10928 KB |
| subtask1_09.txt | WA | 80 ms | 10904 KB |
| subtask1_10.txt | WA | 81 ms | 10904 KB |
| subtask1_11.txt | WA | 80 ms | 10928 KB |
| subtask1_12.txt | WA | 80 ms | 10904 KB |
| subtask1_13.txt | WA | 80 ms | 10996 KB |
| subtask1_14.txt | WA | 80 ms | 10928 KB |
| subtask1_15.txt | WA | 81 ms | 10904 KB |
| subtask2_01.txt | AC | 358 ms | 10928 KB |
| subtask2_02.txt | WA | 379 ms | 10928 KB |
| subtask2_03.txt | AC | 363 ms | 10928 KB |
| subtask2_04.txt | WA | 380 ms | 10928 KB |
| subtask2_05.txt | AC | 364 ms | 10904 KB |
| subtask2_06.txt | WA | 381 ms | 10904 KB |
| subtask2_07.txt | WA | 373 ms | 10904 KB |
| subtask2_08.txt | WA | 391 ms | 10904 KB |
| subtask2_09.txt | WA | 387 ms | 10904 KB |
| subtask2_10.txt | WA | 381 ms | 10996 KB |
| subtask2_11.txt | WA | 391 ms | 10904 KB |
| subtask2_12.txt | WA | 382 ms | 10904 KB |
| subtask2_13.txt | WA | 388 ms | 10928 KB |
| subtask2_14.txt | WA | 379 ms | 10928 KB |
| subtask2_15.txt | WA | 378 ms | 10904 KB |
| subtask2_16.txt | WA | 378 ms | 10928 KB |
| subtask2_17.txt | WA | 371 ms | 10928 KB |
| subtask2_18.txt | WA | 381 ms | 10904 KB |
| subtask2_19.txt | WA | 389 ms | 10904 KB |
| subtask2_20.txt | WA | 385 ms | 10876 KB |
| subtask2_21.txt | WA | 378 ms | 10928 KB |
| subtask2_22.txt | WA | 387 ms | 10904 KB |
| subtask2_23.txt | WA | 375 ms | 10904 KB |
| subtask2_24.txt | WA | 379 ms | 10928 KB |
| subtask2_25.txt | WA | 373 ms | 10904 KB |