/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 516.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Accepted 1ms 324.0 KiB
#5 Accepted 1ms 364.0 KiB
#6 Accepted 1ms 320.0 KiB
#7 Accepted 1ms 320.0 KiB
#8 Accepted 1ms 324.0 KiB
#9 Accepted 31ms 932.0 KiB
#10 Accepted 31ms 928.0 KiB
#11 Accepted 31ms 920.0 KiB
#12 Accepted 1ms 324.0 KiB
#13 Accepted 1ms 324.0 KiB
#14 Accepted 17ms 832.0 KiB
#15 Accepted 17ms 924.0 KiB
#16 Accepted 17ms 924.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;
    int odd =0;
    int summ = 0;
    for(int i=0; i<n; i++)
    {   
       
        if(arr[i]%2!=0 ){
            odd++;
            
        }
    }
    if(odd%2 != 0)
    {
        cout<<-1<<endl;
    }
    else{
        odd = 0;
        for(int i =0; i<n; i++)
        {
            if(arr[i]%2==0 && odd == 0){
                even++;
            }
            else if(arr[i]%2==0 && odd == 1){
                continue;
            }
            else if(arr[i]%2 != 0 && odd==1)
            {
                even++;
                odd = 0;
            }
            else{
                odd++;
                
            }
        }
        cout<<even<<endl;
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-27 20:40:17
Judged At
2024-11-11 03:37:02
Judged By
Score
100
Total Time
31ms
Peak Memory
932.0 KiB