Submission #29789791
Source Code Expand
n = int(input())
ba = [[]] * n
for i in range(n):
a, b = map(int, input().split())
ba[i] = [b, a]
ba = sorted(ba)
last_working_day = 0
answer = 0
for i in range(n):
b, a = ba[i]
if last_working_day < a:
last_working_day = b
answer += 1
print(answer)
Submission Info
| Submission Time | |
|---|---|
| Task | B - 区間スケジューリング問題 |
| User | Pro_ktmr |
| Language | PyPy3 (7.3.0) |
| Score | 100 |
| Code Size | 294 Byte |
| Status | AC |
| Exec Time | 769 ms |
| Memory | 94512 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 100 / 100 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_001.txt |
| All | sample_001.txt, data_001.txt, data_002.txt, data_003.txt, data_004.txt, data_005.txt, data_006.txt, data_007.txt, data_008.txt, data_009.txt, data_010.txt, data_011.txt, data_012.txt, data_013.txt, data_014.txt, data_015.txt, data_016.txt, data_017.txt, data_018.txt, data_019.txt, data_020.txt, sample_001.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| data_001.txt | AC | 407 ms | 83916 KiB |
| data_002.txt | AC | 363 ms | 83468 KiB |
| data_003.txt | AC | 769 ms | 94512 KiB |
| data_004.txt | AC | 166 ms | 77092 KiB |
| data_005.txt | AC | 289 ms | 81316 KiB |
| data_006.txt | AC | 341 ms | 82704 KiB |
| data_007.txt | AC | 539 ms | 89036 KiB |
| data_008.txt | AC | 130 ms | 75848 KiB |
| data_009.txt | AC | 462 ms | 86328 KiB |
| data_010.txt | AC | 648 ms | 91712 KiB |
| data_011.txt | AC | 745 ms | 93948 KiB |
| data_012.txt | AC | 107 ms | 75168 KiB |
| data_013.txt | AC | 472 ms | 86392 KiB |
| data_014.txt | AC | 338 ms | 82932 KiB |
| data_015.txt | AC | 461 ms | 86660 KiB |
| data_016.txt | AC | 112 ms | 75416 KiB |
| data_017.txt | AC | 310 ms | 82220 KiB |
| data_018.txt | AC | 644 ms | 91424 KiB |
| data_019.txt | AC | 326 ms | 82764 KiB |
| data_020.txt | AC | 293 ms | 81712 KiB |
| sample_001.txt | AC | 49 ms | 61796 KiB |