More problems

Codeforces Round 945 (Div. 2)/C. Cat, Fox and Double Maximum.cpp

@@ -0,0 +1,171 @@
+/* Problem URL: https://codeforces.com/problemset/problem/1973/C */
+
+#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 1
+
+void solve()
+{
+    int n;
+    cin >> n;
+
+    vi p(n);
+    cin >> p;
+
+    vi ans;
+    int best = 0;
+
+    priority_queue<pair<int, int>> mi;
+    priority_queue<pair<int, int>, V<pair<int, int>>, greater<>> ma;
+
+    auto getans = [&]() -> pair<vi, int> {
+        vi t(n);
+
+        int now = 1;
+        while (!mi.empty()) {
+            auto [c, i] = mi.top();
+            mi.pop();
+            t[i] = now;
+            now++;
+        }
+
+        now = n;
+        while (!ma.empty()) {
+            auto [c, i] = ma.top();
+            ma.pop();
+            t[i] = now;
+            now--;
+        }
+
+        int ans = 0;
+        nrep(i, 1, n - 1) {
+            ans += t[i] + p[i] > max(t[i + 1] + p[i + 1], t[i - 1] + p[i - 1]);
+        }
+
+        return {t, ans};
+    };
+
+    rep(i, n) {
+        if (i & 1) {
+            mi.emplace(p[i], i);
+        } else {
+            ma.emplace(p[i], i);
+        }
+    }
+
+    auto [t, v] = getans();
+    swap(ans, t);
+    best = v;
+
+    rep(i, n) {
+        if (i & 1) {
+            ma.emplace(p[i], i);
+        } else {
+            mi.emplace(p[i], i);
+        }
+    }
+
+    auto [t2, v2] = getans();
+    if (v2 > best) {
+        swap(ans, t2);
+        best = v2;
+    }
+
+    cout << ans;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}