Submission #526752

#TimeUsernameProblemLanguageResultExecution timeMemory
526752Hydroxic_AcidIzbori (COCI22_izbori)C++14
0 / 110
3065 ms708 KiB
#include <iostream>
#include <cstring>
#include <map>
using namespace std;
#define ll long long

int n;
ll ways = 0;
int arr[200005];
int total[200005];
int highest = 0;

int main(){
    //freopen("test.txt", "r", stdin);
    cin >> n;
    for(int i = 0; i < n; i++) cin >> arr[i];
    for(int l = 0; l < n; l++){
        int one = 0, two = 0;
        for(int r = l; r < n; r++){
            if(arr[r] == 1) one++;
            else two++;
            if(one != two) ways++;
        }
    }

    cout << ways;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...