제출 #878680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878680		noiaint	Izbori (COCI22_izbori)	C++17	110 / 110	596 ms	45952 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

long long sol = 0;
int n;
int a[N];

void dnc(int l, int r) {
    if (l > r) {
        return;
    }
    if (l == r) {
        sol++;
        return;
    }
    int m = (l + r) >> 1;
    map<int, int> maj, fr;
    for (int i = m; i >= l; --i) {
        fr[a[i]]++;
        if (fr[a[i]] >= (m - i + 1) / 2 + 1) maj[a[i]] = 1;
    }
    fr.clear();
    for (int i = m + 1; i <= r; ++i) {
        fr[a[i]]++;
        if (fr[a[i]] >= (i - m) / 2 + 1) maj[a[i]] = 1;
    }
    int add = r - l + 1, lim = 2 * (r - l + 5);
    int *freq = (int*)malloc(lim * sizeof(int));
    for (auto it : maj) {
        memset(freq, 0, lim * sizeof(int));
        int act = 0;
        freq[0 + add]++;
        for (int i = l; i <= m; ++i) {
            if (a[i] == it.fi) ++act;
            else --act;
            if (i < m) freq[act + add]++;
        }
        for (int i = 1; i < lim; ++i) {
            freq[i] += freq[i - 1];
        }
        for (int i = m + 1; i <= r; ++i) {
            if (a[i] == it.fi) ++act;
            else --act;
            sol += freq[act + add - 1];
        }
    }
    dnc(l, m);
    dnc(m + 1, r);
}

void process() {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    dnc(1, n);
    cout << sol;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    #endif

    int tc = 1;
    // cin >> tc;
    
    while (tc--) {
        process();
    }

    return 0;
}

/*

*/  

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