Submission #1514492


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;
using llng = long long;
template<typename T> using v = vector<T>;
template<typename T> using vv = v<v<T> >;

int main() {
    int N, M, X, Y; cin >> N >> M >> X >> Y;
    v<int> a(N); for (int i=0; i<N; i++) cin >> a[i];
    v<int> b(M); for (int i=0; i<M; i++) cin >> b[i];

    int cnt = 0, ai = 0, bi = 0, t = 0;
    while (true) {
        while (ai < N && t > a[ai]) ai++;
        if (ai == N) break;
        t = a[ai] + X;
        while (bi < M && t > b[bi]) bi++;
        if (bi == M) break;
        t = b[bi] + Y;
        cnt++;
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User hidollara
Language C++14 (GCC 5.4.1)
Score 100
Code Size 711 Byte
Status AC
Exec Time 72 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 18
AC × 33
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 53 ms 1024 KB
subtask0_1.txt AC 33 ms 640 KB
subtask0_10.txt AC 38 ms 768 KB
subtask0_11.txt AC 42 ms 896 KB
subtask0_12.txt AC 48 ms 896 KB
subtask0_13.txt AC 36 ms 768 KB
subtask0_14.txt AC 46 ms 896 KB
subtask0_2.txt AC 41 ms 768 KB
subtask0_3.txt AC 42 ms 768 KB
subtask0_4.txt AC 41 ms 768 KB
subtask0_5.txt AC 31 ms 640 KB
subtask0_6.txt AC 53 ms 1024 KB
subtask0_7.txt AC 43 ms 896 KB
subtask0_8.txt AC 32 ms 640 KB
subtask0_9.txt AC 54 ms 1024 KB
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_0.txt AC 71 ms 896 KB
subtask1_1.txt AC 65 ms 896 KB
subtask1_10.txt AC 45 ms 640 KB
subtask1_11.txt AC 63 ms 896 KB
subtask1_12.txt AC 69 ms 896 KB
subtask1_13.txt AC 72 ms 896 KB
subtask1_14.txt AC 55 ms 768 KB
subtask1_2.txt AC 68 ms 896 KB
subtask1_3.txt AC 57 ms 768 KB
subtask1_4.txt AC 64 ms 896 KB
subtask1_5.txt AC 64 ms 896 KB
subtask1_6.txt AC 63 ms 896 KB
subtask1_7.txt AC 61 ms 896 KB
subtask1_8.txt AC 63 ms 896 KB
subtask1_9.txt AC 71 ms 896 KB