/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 432.0 KiB
#3 Accepted 2ms 336.0 KiB
#4 Accepted 2ms 332.0 KiB
#5 Accepted 2ms 328.0 KiB
#6 Accepted 2ms 332.0 KiB
#7 Accepted 2ms 540.0 KiB
#8 Accepted 2ms 356.0 KiB
#9 Accepted 53ms 928.0 KiB
#10 Accepted 52ms 932.0 KiB
#11 Accepted 52ms 932.0 KiB
#12 Accepted 3ms 504.0 KiB
#13 Accepted 2ms 352.0 KiB
#14 Accepted 30ms 928.0 KiB
#15 Accepted 29ms 932.0 KiB
#16 Accepted 29ms 932.0 KiB

Code

#include <iostream>
#include <vector>

using namespace std;

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

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

    int even = 0;
    int sum = 0;

    for (int i = 0; i < size; i++) {
        sum += n[i];
        if (sum % 2 == 0) {
            even++;
            sum = 0;
        }
    }

    if (sum == 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 18:15:44
Judged At
2024-11-11 03:37:15
Judged By
Score
100
Total Time
53ms
Peak Memory
932.0 KiB