Submission #66298684

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

/////////////////////// MACROS ///////////////////////
using ll = long long;
using ld = long double;
using db = double;
using str = string;

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pdb = pair<db, db>;

using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vc = vector<char>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T, SZ>;
tcTU> using PR = pair<T,U>;
tcTU> using umap = unordered_map<T, U>;
tcT> using uset = unordered_set<T>;
tcT> using mset = multiset<T>;
tcT> using pqg = priority_queue<T, vector<T>, greater<T>>;
tcT> using pql = priority_queue<T, vector<T>, less<T>>;

// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;

// tcT> using iset = tree<T, null_type, less<T>, rb_tree_tag,
//     tree_order_statistics_node_update>;

tcT> bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0; }
tcT> bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0; }

#define mp make_pair
#define f first
#define s second
#define nl '\n'

#define sz(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define ppb pop_back
#define ppf pop_front
#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define each(x, a) for (auto& x: a)

/////////////////////// OUTPUT ///////////////////////
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
  #ifdef LOCAL
    return b ? "true" : "false";
  #else
    return ts((int)b);
  #endif
}
tcTU> str ts(pair<T,U> p);
tcTU> str ts(V<pair<T, U>> v);
tcT> str ts(T v);

tcTU> str ts(pair<T,U> p) {
  #ifdef LOCAL
    return "("+ts(p.f)+", "+ts(p.s)+")";
  #else
    return ts(p.f)+" "+ts(p.s);
  #endif
}
 
tcTU> str ts(V<pair<T, U>> v) {
  #ifdef LOCAL
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
      if (!fst) res += ", ";
      fst = 0; res += ts(x);
    }
    res += "}"; return res;
  #else
    bool fst = 1; str res = "";
    for (const auto& x: v) {
      if (!fst) res += " ";
      fst = 0; res += ts(x);
    }
    return res;
  #endif
}
 
tcT> str ts(T v) {
  #ifdef LOCAL
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
      if (!fst) res += ", ";
      fst = 0; res += ts(x);
    }
    res += "}"; return res;
  #else
    bool fst = 1; str res = "";
    for (const auto& x: v) {
      if (!fst) res += " ";
      fst = 0; res += ts(x);
    }
    return res;
 
  #endif
}
 
/////////////////////// DEBUG ///////////////////////
#define tcTUU tcT, class ...U
void DBG() { cerr << "]" << "\e[0m" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
  cerr << ts(t); if (sizeof...(u)) cerr << ", ";
  DBG(u...); }
#ifdef LOCAL
  #define dbg(...) cerr << "\e[1m" << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
  #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
     << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
  #define dbg(...) 0
  #define chk(...) 0
#endif 

/////////////////////// CODE ///////////////////////

const int INF = int(1e9)+100;
const ll LINF = ll(3e18)+10;
const int MOD = int(1e9)+7;
const int MX = int(2e5)+5;

void solve() {
  int n, s; cin >> n >> s; 
  vi a(n); each(x, a) cin >> x;

  int cur = 0;
  F0R(i, n){
    if (a[i]-cur > s){
      cout << "No" << nl;
      return;
    }
    cur = a[i];
  }

  cout << "Yes" << nl;
} 

int main(){
  cin.tie(0)->sync_with_stdio(0);
  int t = 1;
  // cin >> t;
  while(t--){
    solve();
  }
}

Submission Info

Judge Result