oj.uz

Submission #907502

# Submission time Handle Problem Language Result Execution time Memory
907502 2024-01-15T18:05:25 Z vjudge1 Izbori (COCI22_izbori) C++17
25 / 110
 297 ms 15628 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
int n, a[200001], num = 0, cnt[200001], sz = 500, cnt2[200001], res = 0, c[200001], pfs[400001], dp[200001], sl[400001];
pair<int, int> b[200001];
vector<int> v;
bool check[200001];

bool cmp(pair<int, int> a, pair<int, int> b) {
    return a.second < b.second;
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i].first = a[i];
        b[i].second = i;
    }
    int last = -1;
    sort(b + 1, b + 1 + n);
    for (int i = 1; i <= n; i++) {
        int l2 = b[i].first;
        if(b[i].first == last) b[i].first = num;
        else b[i].first = ++num;
        last = l2;
    }
    sort(b + 1, b + 1 + n, cmp);
    for (int i = 1; i <= n; i++) {
        a[i] = b[i].first;
        cnt[a[i]]++;
        if(cnt[a[i]] > sz && !check[a[i]]) {
            v.push_back(a[i]);
            check[a[i]] = true;
        }
    }
    for (int i = 1; i <= n; i++) {
        int mx = 1;
        for (int j = i; j <= min(i + 2 * sz - 1, n); j++) {
            num = j - i + 1;
            if(cnt[a[j]] <= sz) {
                cnt2[a[j]]++;
                mx = max(mx, cnt2[a[j]]);
                if(mx > num / 2) res++;
            }
        }
        for (int j = i; j <= min(i + 2 * sz - 1, n); j++) {
            if(cnt[a[j]] < sz) cnt2[a[j]]--;
        }
    }
    //cout << res << '\n';
    for (int i = 0; i < v.size(); i++) {
        int bnum = v[i];
        pfs[0] = n;
        sl[n] = 1;
        for (int j = 1; j <= n; j++) {
            if(a[j] == bnum) c[j] = 1;
            else c[j] = -1;
            pfs[j] = pfs[j - 1] + c[j];
            dp[pfs[j]] = dp[pfs[j] - 1] + sl[pfs[j] - 1];
            sl[pfs[j]]++;
            res += dp[pfs[j]];
        }
        for (int j = 1; j <= n; j++) {
            sl[pfs[j]] = 0;
            dp[pfs[j]] = 0;
        }
    }
    cout << res << '\n';
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:55:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 4 ms 4584 KB Output is correct
11 Correct 4 ms 4444 KB Output is correct
12 Correct 4 ms 4444 KB Output is correct
13 Correct 4 ms 4512 KB Output is correct
14 Correct 4 ms 4580 KB Output is correct
15 Correct 4 ms 4440 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 4 ms 10840 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 15092 KB Output is correct
2 Correct 269 ms 15428 KB Output is correct
3 Correct 148 ms 12800 KB Output is correct
4 Correct 266 ms 15476 KB Output is correct
5 Correct 296 ms 15556 KB Output is correct
6 Incorrect 297 ms 15628 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 4 ms 4584 KB Output is correct
11 Correct 4 ms 4444 KB Output is correct
12 Correct 4 ms 4444 KB Output is correct
13 Correct 4 ms 4512 KB Output is correct
14 Correct 4 ms 4580 KB Output is correct
15 Correct 4 ms 4440 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 4 ms 10840 KB Output is correct
18 Correct 195 ms 15092 KB Output is correct
19 Correct 269 ms 15428 KB Output is correct
20 Correct 148 ms 12800 KB Output is correct
21 Correct 266 ms 15476 KB Output is correct
22 Correct 296 ms 15556 KB Output is correct
23 Incorrect 297 ms 15628 KB Output isn't correct
24 Halted 0 ms 0 KB -