oj.uz

답안 #730490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
730490 2023-04-26T03:23:41 Z CDuong Izbori (COCI22_izbori) C++17
110 / 110
 2081 ms 20776 KB 
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const int block = 450;
const ll oo = 1e18;

int dp[mxN], fenw[2 * mxN];
int n, a[mxN], cnt[mxN];
map<int, int> num;
map<int, vi> mp;
bool vis[mxN];
ll ans;

void update(int idx, int val) {
    while(idx < 2 * mxN) {
        fenw[idx] += val;
        idx += (idx & (-idx));
    }
}

int get(int idx) {
    int res = 0;
    while(idx) {
        res += fenw[idx];
        idx -= (idx & (-idx));
    }
    return res;
}

void calc_light() {
    for(int i = 1; i <= n; ++i) {
        int max_len = min(n - i + 1, 2 * block), maxx = 0;
        vi cur;
        for(int len = 1; len <= max_len; ++len) {
            int r = i + len - 1;
            if(!vis[a[r]]) {
                continue;
            }
            cnt[a[r]]++;
            cur.emplace_back(a[r]);
            maxx = max(maxx, cnt[a[r]]);
            if(maxx * 2 > len) {
                ++ans;
            }
        }
        for(int &val : cur) {
            cnt[val] = 0;
        }
    }
}

void calc_heavy(vi &v) {
    memset(fenw, 0, sizeof fenw);
    int cur_sum = mxN, cur_idx = 0;
    update(cur_sum, 1);
    for(int i = 1; i <= n; ++i) {
        if(cur_idx < (int)v.size() && i == v[cur_idx]) {
            ++cur_sum, ++cur_idx;
        }
        else {
            --cur_sum;
        }

        ans += get(cur_sum - 1);
        update(cur_sum, 1);
    }
}

int comp(int val) {
    if(num[val] == 0) {
        num[val] = num.size();
    }
    return num[val];
}

void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        a[i] = comp(a[i]);
        mp[a[i]].emplace_back(i);
    }
    for(auto &[val, v] : mp) {
        if((int)mp[val].size() < block) {
            vis[val] = true;
        }
        else {
            calc_heavy(v);
        }
    }
    calc_light();
    cout << ans << endl;
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
    auto end = chrono::high_resolution_clock::now();
    cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
    cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 12 ms 388 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 10 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 10 ms 380 KB Output is correct
16 Correct 10 ms 340 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 3144 KB Output is correct
2 Correct 128 ms 3400 KB Output is correct
3 Correct 74 ms 2832 KB Output is correct
4 Correct 139 ms 3464 KB Output is correct
5 Correct 154 ms 3500 KB Output is correct
6 Correct 147 ms 3696 KB Output is correct
7 Correct 155 ms 3776 KB Output is correct
8 Correct 151 ms 3656 KB Output is correct
9 Correct 143 ms 3656 KB Output is correct
10 Correct 146 ms 3712 KB Output is correct
11 Correct 167 ms 3596 KB Output is correct

Subtask #4
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 9 ms 340 KB Output is correct
11 Correct 12 ms 388 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 10 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 10 ms 380 KB Output is correct
16 Correct 10 ms 340 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 97 ms 3144 KB Output is correct
19 Correct 128 ms 3400 KB Output is correct
20 Correct 74 ms 2832 KB Output is correct
21 Correct 139 ms 3464 KB Output is correct
22 Correct 154 ms 3500 KB Output is correct
23 Correct 147 ms 3696 KB Output is correct
24 Correct 155 ms 3776 KB Output is correct
25 Correct 151 ms 3656 KB Output is correct
26 Correct 143 ms 3656 KB Output is correct
27 Correct 146 ms 3712 KB Output is correct
28 Correct 167 ms 3596 KB Output is correct
29 Correct 149 ms 3600 KB Output is correct
30 Correct 241 ms 6000 KB Output is correct
31 Correct 506 ms 10884 KB Output is correct
32 Correct 1286 ms 20776 KB Output is correct
33 Correct 534 ms 11440 KB Output is correct
34 Correct 552 ms 11888 KB Output is correct
35 Correct 350 ms 8456 KB Output is correct
36 Correct 205 ms 5484 KB Output is correct
37 Correct 253 ms 6472 KB Output is correct
38 Correct 163 ms 3724 KB Output is correct
39 Correct 166 ms 3620 KB Output is correct
40 Correct 166 ms 3756 KB Output is correct
41 Correct 191 ms 3540 KB Output is correct
42 Correct 175 ms 3836 KB Output is correct
43 Correct 206 ms 4008 KB Output is correct
44 Correct 201 ms 3944 KB Output is correct
45 Correct 198 ms 3924 KB Output is correct
46 Correct 207 ms 3924 KB Output is correct
47 Correct 197 ms 3980 KB Output is correct
48 Correct 1195 ms 3764 KB Output is correct
49 Correct 1184 ms 3876 KB Output is correct
50 Correct 555 ms 4112 KB Output is correct
51 Correct 572 ms 4100 KB Output is correct
52 Correct 2081 ms 3640 KB Output is correct
53 Correct 1958 ms 4300 KB Output is correct
54 Correct 1131 ms 4428 KB Output is correct