Submission #1082934

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082934		vjudge1	Izbori (COCI22_izbori)	C++17	10 / 110	227 ms	9556 KiB

Main

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
#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;

typedef tree<
pair<int, int>,
null_type,
less<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

typedef long long ll;
const int MAX = 2e5 + 2;
const int s = 447;
int a[MAX], p[MAX], cnt[MAX], cnt1[MAX], n;
ll res;
map<int, int> mp;

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        mp[a[i]]++;
    }
    int m = 0;
    for (auto i : mp) {
        mp[i.first] = ++m;
    }
    for (int i = 1; i <= n; i++) {
        a[i] = mp[a[i]];
        cnt1[a[i]]++;
    }
    for (int i = 1; i <= n; i++) {
        int mx = 0;
        for (int j = i; j <= min(n, i + 2 * s - 1); j++) {
            if (cnt1[a[j]] <= s) {
                cnt[a[j]]++;
                mx = max(mx, cnt[a[j]]);
                if (mx > (j - i + 1 - mx)) res++;
            }
        }
        for (int j = i; j <= min(n, i + 2 * s - 1); j++) {
            if (cnt1[a[j]] <= s) cnt[a[j]]--;
        }
    }
    for (int i = 1; i <= m; i++) {
        if (cnt1[i] <= s) continue;
        for (int j = 1; j <= n; j++) p[j] = p[j - 1] + (a[j] == i ? 1 : -1);
        ordered_set st;
        st.insert({0, 0});
        for (int j = 1; j <= n; j++) {
            res += st.order_of_key({p[i], 0});
            st.insert({p[i], j});
        }
    }
    cout << res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 70