Add a bunch of other problems.

Educational Codeforces Round 29/E. Turn Off The TV.cpp

@@ -0,0 +1,184 @@
+/* Problem URL: https://codeforces.com/contest/863/problem/E */
+
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+
+
+void pre()
+{
+
+}
+
+#define TEST 0
+
+void solve()
+{
+    int n;
+    cin >> n;
+
+    V<pair<ll, ll>> query(n);
+    for (auto &[l, r] : query) {
+        cin >> l >> r;
+    }
+
+    vi p(n);
+    rep(i, n) {
+        p[i] = i;
+    }
+
+    sort(all(p), [&](int ai, int bi){
+         auto [al, ar] = query[ai];
+         auto [bl, br] = query[bi];
+
+         if (al == bl) {
+            return ar > br;
+         }
+         return al < bl;
+         });
+
+    vvl sparse(20, vl(n));
+
+    rep(i, n) {
+        sparse[0][i] = query[p[i]].second;
+    }
+
+    nrep(j, 1, 20) {
+        for (int i = 0; i + (1 << (j - 1)) < n; i++) {
+            sparse[j][i] = max(sparse[j - 1][i], sparse[j - 1][i + (1 << (j - 1))]);
+        }
+    }
+
+    auto mquery = [&](int l, int r) {
+        int log = 31 - __builtin_clz(r - l + 1);
+        return max(sparse[log][l], sparse[log][r - (1 << log) + 1]);
+    };
+
+    int ans = -1;
+
+    nrep(i, 1, n) {
+        auto [l, r] = query[p[i]];
+        int lim = mquery(0, i - 1);
+
+        if (lim >= r) {
+            ans = p[i] + 1;
+            break;
+        }
+
+        lim++;
+
+        int low = i + 1;
+        int high = n - 1;
+        int act = -1;
+        while (low <= high) {
+            int mid = (low + high) >> 1;
+
+            if (query[p[mid]].first <= lim) {
+                act = mid;
+                low = mid + 1;
+                continue;
+            }
+
+            high = mid - 1;
+        }
+
+        if (act == -1) {
+            continue;
+        }
+
+        if (mquery(i + 1, act) >= r) {
+            ans = p[i] + 1;
+            break;
+        }
+    }
+
+    cout << ans << '\n';
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}