oj.uz

Submission #533499

# Submission time Handle Problem Language Result Execution time Memory
533499 2022-03-06T08:14:55 Z kartel Izbori (COCI22_izbori) C++14
40 / 110
 3000 ms 17296 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pb push_back
#define sz(x) (int)x.size()
using namespace std;
typedef long long ll;

const int N = 2e5 + 500;
const int SQ = 200;

int t[N];
vector <int> vl, vals;
int pf[N], a[N], n;
vector <int> ps1[N], ps2[N];
ll ans = 0;

void upd(int v, int val) {for (; v < N; v = (v | (v + 1))) t[v] += val;}
int get(int v) {int ret = 0; for (; v >= 0; v = (v & (v + 1)) - 1) ret += t[v]; return ret;}

void calc_big(int x) {
    vl.clear();
    for (int i = 1; i <= n; i++) {
        pf[i] = pf[i - 1] + (x == a[i]);
        vl.pb(2 * pf[i - 1] - i + 1);
    }
    sort(all(vl));
    vl.resize(unique(all(vl)) - vl.begin());

    for (int i = 1; i <= n; i++) {
        upd(lower_bound(all(vl), 2 * pf[i - 1] - i + 1) - vl.begin(), 1);
        ans += get(lower_bound(all(vl), 2 * pf[i] - i) - vl.begin() - 1);
    }
    for (int i = 1; i <= n; i++) {
        upd(lower_bound(all(vl), 2 * pf[i - 1] - i + 1) - vl.begin(), -1);
    }
}

void calc_small(int x) {
    for (int i = 1; i < sz(ps1[x]); i++) {
        for (int j = i - 1; j < sz(ps2[x]) - 1; j++) {
            int cnt = (j + 1) - i + 1;
            int mx_len = min(ps2[x][j + 1] - ps1[x][i - 1] - 1, 2 * cnt - 1);
            for (int len = ps2[x][j] - ps1[x][i] + 1; len <= mx_len; len++) {
                ans += max(0, min(ps1[x][i], min(ps1[x][i] + len - 1, ps2[x][j + 1] - 1) - len + 1) - max(ps2[x][j] - len + 1, ps1[x][i - 1] + 1)) + 1;
            }
        }
    }
}

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

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        vals.pb(a[i]);
    }

    sort(all(vals));
    vals.resize(unique(all(vals)) - vals.begin());

    for (int i = 1; i <= n; i++){
        a[i] = lower_bound(all(vals), a[i]) - vals.begin();
        ps1[a[i]].pb(i);
        ps2[a[i]].pb(i);
    }

    for (int x = 0; x < sz(vals); x++) {
        ps1[x].pb(0);
        ps2[x].pb(n + 1);
        sort(all(ps1[x]));
        if (x < SQ && sz(vals) > 2) {
            calc_small(x);
        } else {
            calc_big(x);
        }
    }
    cout << ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 120 ms 9832 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9716 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9808 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 14312 KB Output is correct
2 Correct 79 ms 15728 KB Output is correct
3 Correct 46 ms 13000 KB Output is correct
4 Correct 84 ms 15840 KB Output is correct
5 Correct 109 ms 16252 KB Output is correct
6 Correct 110 ms 16524 KB Output is correct
7 Correct 91 ms 16532 KB Output is correct
8 Correct 111 ms 16460 KB Output is correct
9 Correct 94 ms 16172 KB Output is correct
10 Correct 89 ms 16216 KB Output is correct
11 Correct 76 ms 15848 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 120 ms 9832 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9716 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9808 KB Output is correct
18 Correct 75 ms 14312 KB Output is correct
19 Correct 79 ms 15728 KB Output is correct
20 Correct 46 ms 13000 KB Output is correct
21 Correct 84 ms 15840 KB Output is correct
22 Correct 109 ms 16252 KB Output is correct
23 Correct 110 ms 16524 KB Output is correct
24 Correct 91 ms 16532 KB Output is correct
25 Correct 111 ms 16460 KB Output is correct
26 Correct 94 ms 16172 KB Output is correct
27 Correct 89 ms 16216 KB Output is correct
28 Correct 76 ms 15848 KB Output is correct
29 Correct 86 ms 17296 KB Output is correct
30 Execution timed out 3074 ms 12956 KB Time limit exceeded
31 Halted 0 ms 0 KB -