Submission #7575636

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define REP(i, n) for(int i=0; i<n; i++)
using namespace std;

int main() {
    int a, b;
    int T, N, M;
    queue<int> A, B;
    cin >> T >> N;
    REP(i, N) {
        cin >> a;
        A.push(a);
    };
    cin >> M;
    REP(i, M) {
        cin >> b;
        B.push(b);
    }

    while (!B.empty()) {
        b = B.front();
        while (!A.empty()) {
            a = A.front();
            if (a <= b && b <= a + T) {
                A.pop();
                B.pop();
                break;
            } else {
                A.pop();
            }
        }
        if (A.empty()) break;
    }

    if (A.empty() && !B.empty()) cout << "no" << endl;
    else cout << "yes" << endl;
}

Submission Info

Judge Result