Add a bunch of other problems.

Codeforces Round 881 (Div. 3)/E. Tracking Segments.cpp

@@ -0,0 +1,203 @@
+/* Problem URL: https://codeforces.com/problemset/problem/1843/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;
+
+const int MAX = 1e5+10, UPD = 1e5+10, LOG = 18;
+const int MAXS = 2*MAX+UPD*LOG;
+
+namespace perseg {
+	ll seg[MAXS];
+	int rt[UPD], L[MAXS], R[MAXS], cnt, t;
+	int n, *v;
+
+	ll build(int p, int l, int r) {
+		if (l == r) return seg[p] = v[l];
+		L[p] = cnt++, R[p] = cnt++;
+		int m = (l+r)/2;
+		return seg[p] = build(L[p], l, m) + build(R[p], m+1, r);
+	}
+	void build(int n2, int* v2) {
+		n = n2, v = v2;
+		rt[0] = cnt++;
+		build(0, 0, n-1);
+	}
+	ll query(int a, int b, int p, int l, int r) {
+		if (b < l or r < a) return 0;
+		if (a <= l and r <= b) return seg[p];
+		int m = (l+r)/2;
+		return query(a, b, L[p], l, m) + query(a, b, R[p], m+1, r);
+	}
+	ll query(int a, int b, int tt) {
+		return query(a, b, rt[tt], 0, n-1);
+	}
+	ll update(int a, int x, int lp, int p, int l, int r) {
+		if (l == r) return seg[p] = seg[lp]+x;
+		int m = (l+r)/2;
+		if (a <= m)
+			return seg[p] = update(a, x, L[lp], L[p]=cnt++, l, m) + seg[R[p]=R[lp]];
+		return seg[p] = seg[L[p]=L[lp]] + update(a, x, R[lp], R[p]=cnt++, m+1, r);
+	}
+	int update(int a, int x, int tt=t) {
+		update(a, x, rt[tt], rt[++t]=cnt++, 0, n-1);
+		return t;
+	}
+};
+
+void pre()
+{
+
+}
+
+#define TEST 1
+
+void solve()
+{
+    perseg::t = 0;
+    perseg::cnt = 0;
+
+    int n, m;
+    cin >> n >> m;
+
+    V<pair<int, int>> p(m);
+    repv(i, p) {
+        cin >> i.first >> i.second;
+        i.first--, i.second--;
+    }
+
+    vi v2(n);
+    perseg::build(n, v2.data());
+
+    int q;
+    cin >> q;
+    vi que(q);
+    vi pref(n + 1);
+    repv(i, que) {
+        cin >> i;
+        i--;
+        perseg::update(i, 1);
+        pref[i + 1]++;
+    }
+
+    rep(i, n) {
+        pref[i + 1] += pref[i];
+    }
+
+    int ans = oo;
+    repv(seg, p) {
+        int count = pref[seg.second + 1] - pref[seg.first];
+        int lim = ((seg.second - seg.first + 1) >> 1) + 1;
+        if (count < lim) {
+            continue;
+        }
+
+        int low = 1;
+        int high = q;
+        int act = q;
+        while (low <= high) {
+            int mid = (low + high) >> 1;
+
+            int cur = perseg::query(seg.first, seg.second, mid);
+            if (cur >= lim) {
+                act = mid;
+                high = mid - 1;
+                continue;
+            }
+
+            low = mid + 1;
+        }
+
+        rmin(ans, act);
+    }
+
+    cout << (ans == oo ? -1 : ans) << '\n';
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}