Submission #552177
Source Code Expand
import bisect N, M = map(int, input().split()) X, Y = map(int, input().split()) ali = [int(i) for i in input().split()] bli = [int(i) for i in input().split()] res, idx = 0, 0 func = lambda li, i: bisect.bisect_left(li, i) while True: if idx >= N: break idx = func(bli, ali[idx] + X) if idx >= M: break idx = func(ali, bli[idx] + Y) res += 1 print(res)
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | yumechi |
Language | Python (3.4.2) |
Score | 100 |
Code Size | 405 Byte |
Status | AC |
Exec Time | 402 ms |
Memory | 21856 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 309 ms | 20496 KB |
subtask0_1.txt | AC | 193 ms | 15188 KB |
subtask0_10.txt | AC | 201 ms | 15744 KB |
subtask0_11.txt | AC | 219 ms | 18328 KB |
subtask0_12.txt | AC | 264 ms | 18048 KB |
subtask0_13.txt | AC | 203 ms | 15860 KB |
subtask0_14.txt | AC | 247 ms | 18284 KB |
subtask0_2.txt | AC | 210 ms | 17480 KB |
subtask0_3.txt | AC | 253 ms | 16932 KB |
subtask0_4.txt | AC | 221 ms | 18284 KB |
subtask0_5.txt | AC | 188 ms | 14672 KB |
subtask0_6.txt | AC | 270 ms | 20944 KB |
subtask0_7.txt | AC | 217 ms | 17060 KB |
subtask0_8.txt | AC | 183 ms | 14528 KB |
subtask0_9.txt | AC | 274 ms | 21856 KB |
subtask0_sample_01.txt | AC | 104 ms | 6756 KB |
subtask0_sample_02.txt | AC | 105 ms | 6884 KB |
subtask0_sample_03.txt | AC | 103 ms | 6880 KB |
subtask1_0.txt | AC | 400 ms | 20248 KB |
subtask1_1.txt | AC | 312 ms | 19144 KB |
subtask1_10.txt | AC | 259 ms | 15152 KB |
subtask1_11.txt | AC | 230 ms | 19148 KB |
subtask1_12.txt | AC | 402 ms | 20780 KB |
subtask1_13.txt | AC | 338 ms | 20776 KB |
subtask1_14.txt | AC | 209 ms | 17708 KB |
subtask1_2.txt | AC | 239 ms | 20008 KB |
subtask1_3.txt | AC | 338 ms | 17408 KB |
subtask1_4.txt | AC | 316 ms | 19060 KB |
subtask1_5.txt | AC | 225 ms | 18456 KB |
subtask1_6.txt | AC | 362 ms | 18488 KB |
subtask1_7.txt | AC | 316 ms | 17476 KB |
subtask1_8.txt | AC | 234 ms | 19040 KB |
subtask1_9.txt | AC | 391 ms | 19500 KB |