oj.uz

Submission #1082939

# Submission time Handle Problem Language Result Execution time Memory
1082939 2024-09-02T07:08:28 Z vjudge1 Izbori (COCI22_izbori) C++17
110 / 110
 1767 ms 8984 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
#include <bits/stdc++.h>
using namespace std;

struct fenwick {
    vector<int> b;
    int n = 0;
    int m = 0;
    int o = 0;
    
    void start(int x) {
        n = x;
        b.resize(x + 1, o);
    }
    
    void insertVal(int x) {
        m++;
        update(m, x);
    }
        
    void update(int idx, int x) {
    	for (; idx <= n; idx += idx & -idx) b[idx] += x;
    }
    	
    int query1(int idx) {
    	int res = 0;
    	for (; idx > 0; idx -= idx & -idx) res += b[idx];
    	return res;
    }
    
    int query(int l, int r) {
        return query1(r) - query1(l - 1);
    }
};

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;
        p[0] = 0;
        for (int j = 1; j <= n; j++) p[j] = p[j - 1] + (a[j] == i ? 1 : -1);
        for (int j = 0; j <= n; j++) p[j] += n;
        fenwick st;
        st.start(2 * n);
        for (int j = 1; j <= 2 * n; j++) st.insertVal(0);
        st.update(p[0], 1);
        for (int j = 1; j <= n; j++) {
            res += st.query(1, p[j] - 1);
            st.update(p[j], 1);
        }
    }
    cout << res;
}

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 476 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 484 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 4048 KB Output is correct
2 Correct 166 ms 4436 KB Output is correct
3 Correct 97 ms 3480 KB Output is correct
4 Correct 174 ms 4692 KB Output is correct
5 Correct 189 ms 4764 KB Output is correct
6 Correct 193 ms 4948 KB Output is correct
7 Correct 190 ms 4944 KB Output is correct
8 Correct 196 ms 4944 KB Output is correct
9 Correct 191 ms 4824 KB Output is correct
10 Correct 196 ms 4948 KB Output is correct
11 Correct 190 ms 4948 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 476 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 484 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 139 ms 4048 KB Output is correct
19 Correct 166 ms 4436 KB Output is correct
20 Correct 97 ms 3480 KB Output is correct
21 Correct 174 ms 4692 KB Output is correct
22 Correct 189 ms 4764 KB Output is correct
23 Correct 193 ms 4948 KB Output is correct
24 Correct 190 ms 4944 KB Output is correct
25 Correct 196 ms 4944 KB Output is correct
26 Correct 191 ms 4824 KB Output is correct
27 Correct 196 ms 4948 KB Output is correct
28 Correct 190 ms 4948 KB Output is correct
29 Correct 190 ms 4820 KB Output is correct
30 Correct 118 ms 2392 KB Output is correct
31 Correct 251 ms 5716 KB Output is correct
32 Correct 611 ms 8984 KB Output is correct
33 Correct 267 ms 6132 KB Output is correct
34 Correct 271 ms 6220 KB Output is correct
35 Correct 183 ms 4944 KB Output is correct
36 Correct 101 ms 2136 KB Output is correct
37 Correct 128 ms 2612 KB Output is correct
38 Correct 205 ms 4776 KB Output is correct
39 Correct 221 ms 4944 KB Output is correct
40 Correct 203 ms 4948 KB Output is correct
41 Correct 204 ms 4944 KB Output is correct
42 Correct 215 ms 4948 KB Output is correct
43 Correct 260 ms 4944 KB Output is correct
44 Correct 235 ms 4804 KB Output is correct
45 Correct 241 ms 4944 KB Output is correct
46 Correct 232 ms 4948 KB Output is correct
47 Correct 231 ms 4944 KB Output is correct
48 Correct 962 ms 4948 KB Output is correct
49 Correct 967 ms 5456 KB Output is correct
50 Correct 500 ms 5388 KB Output is correct
51 Correct 514 ms 5540 KB Output is correct
52 Correct 1726 ms 5724 KB Output is correct
53 Correct 1767 ms 5720 KB Output is correct
54 Correct 963 ms 5456 KB Output is correct