oj.uz

답안 #533540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533540 2022-03-06T09:08:00 Z kartel Izbori (COCI22_izbori) C++14
40 / 110
 3000 ms 20352 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()
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("-O3")
#define el "\n"
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);
    }
}

ll get_ar(ll a0, ll cnt, ll d) {
    return ((2 * a0 + d * (cnt - 1)) * cnt) / 2ll;
}

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);
            int mn_len = ps2[x][j] - ps1[x][i] + 1;
            if (mn_len > mx_len) {
                continue;
            }

            int R = min(ps2[x][j + 1] - 1, ps1[x][i] + mx_len - 1);
            int seg = R - ps2[x][j] + 1;
            int ps_l = max(R - mx_len + 1, ps1[x][i - 1] + 1);
            ans += max(0ll, (ps1[x][i] - ps_l + 1) * 1ll * seg); /// [ps_l; ps1[i]] = all_segnent
            int len = max(0, min((ps_l - 1 - max(ps2[x][j] - mx_len + 1, ps1[x][i - 1] + 1) + 1),
                                 seg - 1));
            ans += get_ar(seg - 1, len, -1);

//            for (int len = ps2[x][j] - ps1[x][i] + 1; len <= mx_len; len++) {
//                cerr << x << " " << i << " " << j << " " << len << " " << 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 << el;
//                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;
//            }
//            cerr << el;
        }
    }
}

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

    cin >> n;
    mt19937 rnd(time(0));
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
//        a[i] = rnd() % 2;
        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++) {
        if (sz(ps1[x]) < SQ) {
            ps1[x].pb(0);
            ps2[x].pb(n + 1);
            sort(all(ps1[x]));
            calc_small(x);
        } else {
            calc_big(x);
        }
    }
    cout << ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 7 ms 9692 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 7 ms 9692 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 5 ms 9804 KB Output is correct
8 Correct 5 ms 9748 KB Output is correct
9 Correct 6 ms 9804 KB Output is correct
10 Correct 7 ms 9804 KB Output is correct
11 Correct 5 ms 9804 KB Output is correct
12 Correct 8 ms 9792 KB Output is correct
13 Correct 7 ms 9804 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 7 ms 9804 KB Output is correct
17 Correct 8 ms 9804 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 14280 KB Output is correct
2 Correct 60 ms 15348 KB Output is correct
3 Correct 37 ms 12776 KB Output is correct
4 Correct 67 ms 15404 KB Output is correct
5 Correct 68 ms 15840 KB Output is correct
6 Correct 69 ms 16108 KB Output is correct
7 Correct 76 ms 16256 KB Output is correct
8 Correct 80 ms 16316 KB Output is correct
9 Correct 71 ms 16116 KB Output is correct
10 Correct 66 ms 16052 KB Output is correct
11 Correct 60 ms 15596 KB Output is correct

Subtask #4
0 / 70.0

# 결과 실행 시간 메모리 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 7 ms 9692 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 5 ms 9804 KB Output is correct
8 Correct 5 ms 9748 KB Output is correct
9 Correct 6 ms 9804 KB Output is correct
10 Correct 7 ms 9804 KB Output is correct
11 Correct 5 ms 9804 KB Output is correct
12 Correct 8 ms 9792 KB Output is correct
13 Correct 7 ms 9804 KB Output is correct
14 Correct 8 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 7 ms 9804 KB Output is correct
17 Correct 8 ms 9804 KB Output is correct
18 Correct 57 ms 14280 KB Output is correct
19 Correct 60 ms 15348 KB Output is correct
20 Correct 37 ms 12776 KB Output is correct
21 Correct 67 ms 15404 KB Output is correct
22 Correct 68 ms 15840 KB Output is correct
23 Correct 69 ms 16108 KB Output is correct
24 Correct 76 ms 16256 KB Output is correct
25 Correct 80 ms 16316 KB Output is correct
26 Correct 71 ms 16116 KB Output is correct
27 Correct 66 ms 16052 KB Output is correct
28 Correct 60 ms 15596 KB Output is correct
29 Correct 88 ms 15332 KB Output is correct
30 Correct 25 ms 12104 KB Output is correct
31 Correct 64 ms 14756 KB Output is correct
32 Correct 136 ms 20352 KB Output is correct
33 Correct 58 ms 15044 KB Output is correct
34 Correct 70 ms 15308 KB Output is correct
35 Correct 46 ms 13548 KB Output is correct
36 Correct 20 ms 12112 KB Output is correct
37 Correct 24 ms 12488 KB Output is correct
38 Correct 205 ms 17048 KB Output is correct
39 Correct 221 ms 16812 KB Output is correct
40 Correct 201 ms 17032 KB Output is correct
41 Correct 208 ms 16808 KB Output is correct
42 Correct 214 ms 17088 KB Output is correct
43 Correct 444 ms 18836 KB Output is correct
44 Correct 459 ms 19084 KB Output is correct
45 Correct 492 ms 18776 KB Output is correct
46 Correct 487 ms 18836 KB Output is correct
47 Correct 467 ms 18872 KB Output is correct
48 Execution timed out 3068 ms 16368 KB Time limit exceeded
49 Halted 0 ms 0 KB -