/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Wrong Answer 2ms 324.0 KiB
#3 Wrong Answer 2ms 328.0 KiB
#4 Wrong Answer 2ms 488.0 KiB
#5 Wrong Answer 2ms 332.0 KiB
#6 Accepted 2ms 332.0 KiB
#7 Wrong Answer 2ms 512.0 KiB
#8 Wrong Answer 2ms 332.0 KiB
#9 Wrong Answer 57ms 844.0 KiB
#10 Wrong Answer 53ms 924.0 KiB
#11 Wrong Answer 49ms 924.0 KiB
#12 Wrong Answer 2ms 540.0 KiB
#13 Wrong Answer 2ms 484.0 KiB
#14 Wrong Answer 31ms 932.0 KiB
#15 Wrong Answer 31ms 924.0 KiB
#16 Wrong Answer 30ms 924.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

int subarrayCount(vector<int>& arr){
    int n = arr.size();
    int cnt=1, evenSum=0;

    for(int i=0; i<n; i++){
        if(arr[i]%2!=0){
            evenSum=0;
        }
        else{
            evenSum++;
            cnt += evenSum;
        }
    }
    return cnt;
}
int main(){
    int N;
    cin>>N;
    vector<int> arr(N);
    for(int i=0; i<N; i++){
        cin>> arr[i];
    }

    int res = subarrayCount(arr);
    cout<<res<<endl;

    return 0;

}

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Contest
TLE_Headquarters - round #1
Language
C++17 (G++ 13.2.0)
Submit At
2024-03-27 17:38:38
Judged At
2024-10-03 13:55:43
Judged By
Score
15
Total Time
57ms
Peak Memory
932.0 KiB