提出 #73237586

---

ソースコード 拡げる

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in: v) is >> in;
  return is;
}

template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template<typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
 enable_if<is_class_v<T> == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template<typename T, typename V>
 enable_if<is_class_v<T> != 0>::type fill_v(T &t, const V &v) {
  for (auto &e: t) fill_v(e, v);
}

template<typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {
  }

  template<typename... Args>
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template<typename F>
 decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}

int main() {
  int N, M;
  cin >> N >> M;
  vector< vector< int > > add(N);
  for (int i = 0; i < M; i++) {
    int l, r;
    cin >> l >> r;
    --l;
    add[l].emplace_back(r);
  }
  priority_queue< int, vector< int >, greater<> > que;
  for (int i = 0; i < N; i++) {
    for (auto& p : add[i]) {
      que.emplace(p);
    }
    if (not que.empty()) {
      if (i < que.top()) {
        que.pop();
      } else {
        cout << "No" << endl;
        return 0;
      }
    }
  }
  if (not que.empty()) {
    cout << "No" << endl;
  } else {
    cout << "Yes" << endl;
  }
}

提出情報

ジャッジ結果