Submission #3237631
Source Code Expand
import heapq n, m = map(int, input().split()) xy = [[] for _ in range(10**5 + 1)] for i in range(n): x, y = map(int, input().split()) xy[x].append(y) a = [] for i in range(m): a.append(int(input())) a = sorted(a) ans = 0 hq = [] j = 0 for i in a: while j <= i: for k in range(len(xy[j])): heapq.heappush(hq, xy[j][k]) j += 1 while len(hq) > 0: if hq[0] >= i: heapq.heappop(hq) ans += 1 break heapq.heappop(hq) print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - 枕決め |
User | at_cacao_jp |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 548 Byte |
Status | AC |
Exec Time | 721 ms |
Memory | 21328 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00-sample-00, 00-sample-01, 00-sample-02, 10-random-00, 10-random-01, 10-random-02, 10-random-03, 10-random-04, 10-random-05, 10-random-06, 10-random-07, 10-random-08, 10-random-09, 20-random_max-00, 20-random_max-01, 20-random_max-02, 20-random_max-03, 20-random_max-04, 30-corner-00, 30-corner-01 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample-00 | AC | 36 ms | 10308 KB |
00-sample-01 | AC | 36 ms | 10308 KB |
00-sample-02 | AC | 36 ms | 10308 KB |
10-random-00 | AC | 506 ms | 16972 KB |
10-random-01 | AC | 355 ms | 15136 KB |
10-random-02 | AC | 495 ms | 17964 KB |
10-random-03 | AC | 348 ms | 16148 KB |
10-random-04 | AC | 634 ms | 19924 KB |
10-random-05 | AC | 412 ms | 17324 KB |
10-random-06 | AC | 370 ms | 16720 KB |
10-random-07 | AC | 428 ms | 17648 KB |
10-random-08 | AC | 201 ms | 12812 KB |
10-random-09 | AC | 345 ms | 16472 KB |
20-random_max-00 | AC | 707 ms | 21288 KB |
20-random_max-01 | AC | 708 ms | 21292 KB |
20-random_max-02 | AC | 718 ms | 21292 KB |
20-random_max-03 | AC | 712 ms | 21328 KB |
20-random_max-04 | AC | 721 ms | 21288 KB |
30-corner-00 | AC | 355 ms | 16544 KB |
30-corner-01 | AC | 325 ms | 16548 KB |