/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 496.0 KiB
#3 Accepted 3ms 480.0 KiB
#4 Accepted 2ms 476.0 KiB
#5 Accepted 2ms 544.0 KiB
#6 Accepted 2ms 484.0 KiB
#7 Accepted 2ms 516.0 KiB
#8 Accepted 2ms 500.0 KiB
#9 Accepted 16ms 852.0 KiB
#10 Accepted 13ms 912.0 KiB
#11 Accepted 16ms 832.0 KiB
#12 Accepted 2ms 560.0 KiB
#13 Accepted 2ms 740.0 KiB
#14 Accepted 13ms 844.0 KiB
#15 Accepted 13ms 1.168 MiB
#16 Accepted 13ms 932.0 KiB

Code

#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define endl '\n'
#define Endl '\n'

using namespace std;

const int N = 2e5 + 5;
int tc, n, m, a[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); // cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long sum = accumulate(a, a + n, 0ll);
    if (sum & 1) {
        cout << -1 << endl;
    } else {
        int cnt = 0;
        sum = 0;
        for (int i = 0; i < n; i++) {
            sum += a[i];
            if (sum % 2 == 0) {
                cnt++;
                sum = 0;
            }
        }
        cout << cnt << 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 17:00:32
Judged At
2024-11-11 03:37:50
Judged By
Score
100
Total Time
16ms
Peak Memory
1.168 MiB