Submission #552111
Source Code Expand
N, M = map(int, input().split()) X, Y = map(int, input().split()) As = list(map(int, input().split())) Bs = list(map(int, input().split())) def solve(N, M, X, Y, As, Bs): t = 0 n = 0 a = 0 b = 0 while a < N and b < M: while As[a] < t: a += 1 if a == N: return n t = As[a] + X n += 1 while Bs[b] < t: b += 1 if b == M: return n t = Bs[b] + Y n += 1 return n print(solve(N, M, X, Y, As, Bs)//2)
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | rpy3cpp |
Language | Python (3.4.2) |
Score | 100 |
Code Size | 571 Byte |
Status | AC |
Exec Time | 315 ms |
Memory | 21616 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 | 315 ms | 20900 KB |
subtask0_1.txt | AC | 193 ms | 15388 KB |
subtask0_10.txt | AC | 220 ms | 15724 KB |
subtask0_11.txt | AC | 212 ms | 18656 KB |
subtask0_12.txt | AC | 240 ms | 17668 KB |
subtask0_13.txt | AC | 206 ms | 15800 KB |
subtask0_14.txt | AC | 219 ms | 18600 KB |
subtask0_2.txt | AC | 201 ms | 17284 KB |
subtask0_3.txt | AC | 224 ms | 17204 KB |
subtask0_4.txt | AC | 217 ms | 17660 KB |
subtask0_5.txt | AC | 173 ms | 14628 KB |
subtask0_6.txt | AC | 265 ms | 21616 KB |
subtask0_7.txt | AC | 226 ms | 16920 KB |
subtask0_8.txt | AC | 180 ms | 14332 KB |
subtask0_9.txt | AC | 266 ms | 21388 KB |
subtask0_sample_01.txt | AC | 95 ms | 6792 KB |
subtask0_sample_02.txt | AC | 95 ms | 6796 KB |
subtask0_sample_03.txt | AC | 96 ms | 6812 KB |
subtask1_0.txt | AC | 291 ms | 20192 KB |
subtask1_1.txt | AC | 264 ms | 18960 KB |
subtask1_10.txt | AC | 211 ms | 15088 KB |
subtask1_11.txt | AC | 236 ms | 18956 KB |
subtask1_12.txt | AC | 289 ms | 20768 KB |
subtask1_13.txt | AC | 277 ms | 20836 KB |
subtask1_14.txt | AC | 249 ms | 17776 KB |
subtask1_2.txt | AC | 254 ms | 20332 KB |
subtask1_3.txt | AC | 264 ms | 17948 KB |
subtask1_4.txt | AC | 264 ms | 19120 KB |
subtask1_5.txt | AC | 243 ms | 18968 KB |
subtask1_6.txt | AC | 272 ms | 19064 KB |
subtask1_7.txt | AC | 259 ms | 17520 KB |
subtask1_8.txt | AC | 239 ms | 19612 KB |
subtask1_9.txt | AC | 297 ms | 19436 KB |