More problems

Codeforces Round 984 (Div. 3)/E. Reverse the Rivers.cpp

@@ -0,0 +1,180 @@
+/* Problem URL: https://codeforces.com/problemset/problem/2036/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, m, q;
+    cin >> n >> m >> q;
+
+    vvl a(n, vl(m));
+    cin >> a;
+
+    rep(j, m) {
+        nrep(i, 1, n) {
+            a[i][j] |= a[i - 1][j];
+        }
+    }
+
+    while (q--) {
+        int l = 0;
+        int r = n - 1;
+
+        int q;
+        cin >> q;
+        while (q--) {
+            int p;
+            char op;
+            ll c;
+            cin >> p >> op >> c;
+            p--;
+
+            auto findl = [&]() {
+                int low = l;
+                int high = n - 1;
+                int ans = n;
+                while (low <= high) {
+                    int mid = (low + high) >> 1;
+
+                    if (a[mid][p] > c) {
+                        ans = mid;
+                        high = mid - 1;
+                        continue;
+                    }
+
+                    low = mid + 1;
+                }
+                return ans;
+            };
+
+            auto findr = [&]() {
+                int low = 0;
+                int high = r;
+                int ans = -1;
+                while (low <= high) {
+                    int mid = (low + high) >> 1;
+
+                    if (a[mid][p] < c) {
+                        ans = mid;
+                        low = mid + 1;
+                        continue;
+                    }
+
+                    high = mid - 1;
+                }
+                return ans;
+            };
+
+            if (op == '>') {
+                l = findl();
+            } else {
+                r = findr();
+            }
+        }
+
+        if (l > r) {
+            cout << "-1\n";
+            continue;
+        }
+
+        cout << l + 1 << '\n';
+    }
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}