oj.uz

Submission #526700

# Submission time Handle Problem Language Result Execution time Memory
526700 2022-02-16T02:17:25 Z joelau Izbori (COCI22_izbori) C++14
40 / 110
 59 ms 14356 KB 
#include <bits/stdc++.h>
using namespace std;

long long N,A[200005];
map<long long,long long> mp;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N;
    for (long long i = 0; i < N; ++i) cin >> A[i];
    if (N <= 2000) {
        long long ans = 0;
        for (long long i = 0; i < N; ++i) {
            mp.clear();
            long long most = 0;
            for (long long j = i; j < N; ++j) {
                most = max(most,++mp[A[j]]);
                if (most * 2 > j-i+1) ans++;
            }
        }
        cout << ans;
    }
    else {
        long long ans = N * (N+1) / 2, cnt = 0;
        mp[cnt]++;
        for (long long i = 0; i < N; ++i) {
            if (A[i] == 1) cnt--;
            else cnt++;
            ans -= mp[cnt]++;
        }
        cout << ans;
    }

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 48 ms 376 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 35 ms 332 KB Output is correct
10 Correct 37 ms 332 KB Output is correct
11 Correct 37 ms 332 KB Output is correct
12 Correct 37 ms 332 KB Output is correct
13 Correct 37 ms 336 KB Output is correct
14 Correct 36 ms 332 KB Output is correct
15 Correct 36 ms 332 KB Output is correct
16 Correct 36 ms 332 KB Output is correct
17 Correct 6 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1388 KB Output is correct
2 Correct 12 ms 1668 KB Output is correct
3 Correct 7 ms 1100 KB Output is correct
4 Correct 12 ms 1740 KB Output is correct
5 Correct 13 ms 1748 KB Output is correct
6 Correct 15 ms 1868 KB Output is correct
7 Correct 14 ms 1996 KB Output is correct
8 Correct 14 ms 1888 KB Output is correct
9 Correct 16 ms 1876 KB Output is correct
10 Correct 13 ms 1788 KB Output is correct
11 Correct 51 ms 14352 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 48 ms 376 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 35 ms 332 KB Output is correct
10 Correct 37 ms 332 KB Output is correct
11 Correct 37 ms 332 KB Output is correct
12 Correct 37 ms 332 KB Output is correct
13 Correct 37 ms 336 KB Output is correct
14 Correct 36 ms 332 KB Output is correct
15 Correct 36 ms 332 KB Output is correct
16 Correct 36 ms 332 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 9 ms 1388 KB Output is correct
19 Correct 12 ms 1668 KB Output is correct
20 Correct 7 ms 1100 KB Output is correct
21 Correct 12 ms 1740 KB Output is correct
22 Correct 13 ms 1748 KB Output is correct
23 Correct 15 ms 1868 KB Output is correct
24 Correct 14 ms 1996 KB Output is correct
25 Correct 14 ms 1888 KB Output is correct
26 Correct 16 ms 1876 KB Output is correct
27 Correct 13 ms 1788 KB Output is correct
28 Correct 51 ms 14352 KB Output is correct
29 Correct 59 ms 14356 KB Output is correct
30 Incorrect 10 ms 2960 KB Output isn't correct
31 Halted 0 ms 0 KB -