/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Wrong Answer 1ms 324.0 KiB
#5 Accepted 1ms 368.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Wrong Answer 1ms 532.0 KiB

Code

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

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

    int arr[n+1];
    arr[0] ={0};
    for (int i = 1; i < n+1; ++i) {
        cin >> arr[i];
    }
    
    int even = 0;
    for(int i=1; i<=n; i++)
    {
        arr[i] = arr[i] + arr[i-1];
        if(arr[i]%2==0){
            even++;
        }
    }
    if(even >0){
        cout<<even<<endl;
    }
    else{
        cout<<-1<<endl;
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Contest
TLE_Headquarters - round #1
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-27 16:33:32
Judged At
2024-11-11 03:38:29
Judged By
Score
30
Total Time
1ms
Peak Memory
532.0 KiB