oj.uz

Submission #715076

# Submission time Handle Problem Language Result Execution time Memory
715076 2023-03-25T22:08:08 Z keystone Izbori (COCI22_izbori) C++14
0 / 110
 3000 ms 724 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> a(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    int ans = 0;
    for (int l = 1; l <= n; l++) {
        vector<int> cnt(3);
        int mx = 0;
        for (int r = l; r <= n; r++) {
            cnt[a[r]]++;
            mx = max(mx, cnt[a[r]]);
            int tot = r - l + 1;
            if (mx > tot/2 && (tot-mx) <= tot/2) {
                ans++;
            }
        }
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3037 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -