Submission #4022564

---

Source Code Expand

//#include <bits/stdc++.h>
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <climits>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define ROF(i, j, k) for(int i = (int)(j); i >= (int)(k); --i)
#define FORLL(i, n, m) for(long long i = n; i < (long long)(m); i++)
#define SORT(v, n) sort(v, v+n)
#define REVERSE(v) reverse((v).begin(), (v).end())

using namespace std;
using ll = long long;
const ll MOD=1000000007LL;
typedef pair<int, int> P;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

int b[575];
queue<int> a;

int
main(void){  
  int t, n, m;
  cin >> t >> n;
  REP(i, n){
    int itmp = 0;
    cin >> itmp;
    a.push(itmp);
  }
  cin >> m;
  REP(i, m) cin >> b[i];

  if(m > n) {cout << "no" << endl; return 0;}

  int ai=0;
  REP(i, m){
    if(a.empty()) {cout << "no" << endl; return 0;}
    int itmp = a.front();
    a.pop();

    bool f = false;
    if(b[i]-t <= itmp && itmp < b[i]+1){
      f = true;
    }
    if(!f && a.empty()) {cout << "no" << endl; return 0;}
  }

  cout << "yes" << endl;
  
  return 0;
}

Submission Info

Judge Result