/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 328.0 KiB
#3 Accepted 1ms 512.0 KiB
#4 Wrong Answer 1ms 532.0 KiB
#5 Accepted 1ms 532.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];
    
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    
    int even = 0;
    // if(arr[0]%2==0){
    //     even++;
    // }
    int summ =0;
    for(int i=0; i<n; i++)
    {   
       
        if(arr[i]%2==0){
            even++;
            summ = 0;
        }
        else{
            summ += arr[i];
            if(summ%2==0)
            {
                even++;
                summ = 0;
            }

            }
    }

    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 17:04:36
Judged At
2024-11-11 03:37:47
Judged By
Score
30
Total Time
1ms
Peak Memory
532.0 KiB