oj.uz

Submission #715049

# Submission time Handle Problem Language Result Execution time Memory
715049 2023-03-25T21:49:29 Z Gabriel1219 Izbori (COCI22_izbori) C++11
0 / 110
 3000 ms 988 KB 
#include <bits/stdc++.h>
using namespace std;

int favourite[200005];

int main() {
    int n; cin >> n;
    int ans = 0;
    for (int i = 0; i < n; i++) cin >> favourite[i];
    for (int left = 0; left < n; left++) {
        for (int right = left; right < n; right++) {
            int temp1 = 0; int temp2 = 0;
            for (int i = left; i <= right; i++) {
                if (favourite[i] == 1) temp1++;
                else temp2++;
            }
            if (2*max(temp1, temp2) > temp1+temp2) ans++;
        }
    }
    cout << ans << endl;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -