oj.uz

답안 #972269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972269 2024-04-30T10:14:58 Z RandomUser Izbori (COCI22_izbori) C++17
110 / 110
 1754 ms 23520 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,bmi,bmi2,lzcnt,popcnt")
 
struct BIT {
    int n;
    vector<int> tree;
 
    BIT(int _n) {
        n = _n + 10;
        tree.resize(_n+60);
    }
 
    void update(int p, int v) {
        for(p++; p<n; p+=p&-p) tree[p] += v;
    }
 
    int query(int p) {
        int ans = 0;
        for(p++; p>0; p-=p&-p) ans += tree[p];
        return ans;
    }
 
    int query(int l, int r) { return query(r) - query(l-1); }
    void reset() { for(int &x : tree) x = 0; }
};
 
int main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);
 
    int n;
    ll ans = 0;
    cin >> n;
    int B = sqrt(n);
 
    vector<int> v(n+1), comp;
    map<int, int> cnt;
    map<int, vector<int> > mp;
    for(int i=1; i<=n; i++) {
        cin >> v[i];
        if(++cnt[v[i]] == 1) {
            comp.push_back(v[i]);
            mp[v[i]].push_back(0);
        }
        mp[v[i]].push_back(i);
    }
 
    BIT bit(2*n+1000);
    for(int &x : comp) {
        if(cnt[x] >= B) {
            int sum = 0;
            bit.update(n+1, 1);
            for(int i=1; i<=n; i++) {
                sum += (v[i] == x);
                ans += bit.query(2*sum - i - 1 + (n + 1));
                bit.update(2*sum - i + (n + 1), 1);
            }
            bit.reset();
        } else {
            ans += cnt[x];
 
            mp[x].push_back(n+1);
 
            for(int i=1; i<mp[x].size()-1; i++) {
                for(int j=i+1; j<mp[x].size()-1; j++) {
                    if(2 * (j - i + 1) <= mp[x][j] - mp[x][i] + 1) continue;
                    int left = 2 * (j - i + 1) - (mp[x][j] - mp[x][i] + 1) - 1;
                    int L = min(left, mp[x][i] - mp[x][i-1] - 1);
                    int R = mp[x][j+1] - mp[x][j] - 1;
                    ans += L + 1;
 
                    if(left < R) {
                        ans += 1ll * left * (left + 1) / 2;
                    } else {
                        ans += R * (left - R + 1);
                        ans += 1ll * (R - 1) * R / 2;
                    }
                }
            }
        }
    }
 
    cout << ans << '\n';
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:68:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int i=1; i<mp[x].size()-1; i++) {
      |                          ~^~~~~~~~~~~~~~~
Main.cpp:69:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |                 for(int j=i+1; j<mp[x].size()-1; j++) {
      |                                ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 452 KB Output is correct
6 Correct 0 ms 456 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 452 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 488 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3276 KB Output is correct
2 Correct 17 ms 3608 KB Output is correct
3 Correct 10 ms 2176 KB Output is correct
4 Correct 18 ms 3724 KB Output is correct
5 Correct 18 ms 3792 KB Output is correct
6 Correct 25 ms 4276 KB Output is correct
7 Correct 19 ms 4048 KB Output is correct
8 Correct 19 ms 4048 KB Output is correct
9 Correct 20 ms 4048 KB Output is correct
10 Correct 20 ms 4048 KB Output is correct
11 Correct 14 ms 4056 KB Output is correct

Subtask #4
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 452 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 488 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 14 ms 3276 KB Output is correct
19 Correct 17 ms 3608 KB Output is correct
20 Correct 10 ms 2176 KB Output is correct
21 Correct 18 ms 3724 KB Output is correct
22 Correct 18 ms 3792 KB Output is correct
23 Correct 25 ms 4276 KB Output is correct
24 Correct 19 ms 4048 KB Output is correct
25 Correct 19 ms 4048 KB Output is correct
26 Correct 20 ms 4048 KB Output is correct
27 Correct 20 ms 4048 KB Output is correct
28 Correct 14 ms 4056 KB Output is correct
29 Correct 21 ms 4988 KB Output is correct
30 Correct 44 ms 6608 KB Output is correct
31 Correct 107 ms 12236 KB Output is correct
32 Correct 331 ms 23520 KB Output is correct
33 Correct 103 ms 12576 KB Output is correct
34 Correct 125 ms 13188 KB Output is correct
35 Correct 68 ms 9168 KB Output is correct
36 Correct 40 ms 5980 KB Output is correct
37 Correct 49 ms 7040 KB Output is correct
38 Correct 32 ms 4116 KB Output is correct
39 Correct 33 ms 3932 KB Output is correct
40 Correct 33 ms 4512 KB Output is correct
41 Correct 32 ms 3912 KB Output is correct
42 Correct 32 ms 4360 KB Output is correct
43 Correct 65 ms 6092 KB Output is correct
44 Correct 65 ms 5972 KB Output is correct
45 Correct 65 ms 5980 KB Output is correct
46 Correct 65 ms 6072 KB Output is correct
47 Correct 65 ms 5972 KB Output is correct
48 Correct 1069 ms 4688 KB Output is correct
49 Correct 990 ms 4560 KB Output is correct
50 Correct 378 ms 4952 KB Output is correct
51 Correct 385 ms 4752 KB Output is correct
52 Correct 1754 ms 4692 KB Output is correct
53 Correct 1627 ms 4444 KB Output is correct
54 Correct 900 ms 4464 KB Output is correct