/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 540.0 KiB
#2 Accepted 2ms 436.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Accepted 2ms 328.0 KiB
#5 Accepted 2ms 348.0 KiB
#6 Accepted 2ms 548.0 KiB
#7 Accepted 2ms 484.0 KiB
#8 Accepted 2ms 492.0 KiB
#9 Wrong Answer 55ms 928.0 KiB
#10 Accepted 54ms 924.0 KiB
#11 Wrong Answer 54ms 928.0 KiB

Code

//Fahmi_Nafi_46

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

int main() {
    int n;
    cin >> n;
    vector<int> x(n);
    for(int i = 0; i < n; i++) {
        cin >> x[i];
    }

    int count = 0;
    int odd = 0;

    for(int i = 0; i < n; i++) {
        if(x[i] % 2 == 0) {
            count += 1;
        } else {
            odd += 1;
            if(odd % 2 == 0) {
                count += 1;
            }
        }
    }
    if(odd % 2 != 0) {
        cout << -1 << endl;
    } else {
        cout << count << 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 16:31:45
Judged At
2024-11-11 03:38:35
Judged By
Score
50
Total Time
55ms
Peak Memory
928.0 KiB