/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 1ms 324.0 KiB
#4 Accepted 1ms 324.0 KiB
#5 Accepted 1ms 324.0 KiB
#6 Accepted 1ms 324.0 KiB
#7 Accepted 1ms 320.0 KiB
#8 Accepted 1ms 320.0 KiB
#9 Accepted 10ms 532.0 KiB
#10 Accepted 10ms 532.0 KiB
#11 Accepted 10ms 324.0 KiB
#12 Accepted 1ms 532.0 KiB
#13 Accepted 1ms 320.0 KiB
#14 Accepted 7ms 568.0 KiB
#15 Accepted 7ms 320.0 KiB
#16 Accepted 7ms 484.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ff       first
#define ss       second
#define MX       1000005
#define mod      1000000007
#define ll       long long
#define pb       push_back
#define pll      pair<ll,ll>
#define endl     "\n"
#define bug(a)   cerr<<#a<<" : "<<a<<endl
#define all(x)   (x).begin(),(x).end()
#define allr(x)  (x).rbegin(),(x).rend()
#define Mul(a,b) (a%mod * b%mod)%mod
#define Add(a,b) (a%mod + b%mod)%mod


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);


    int n;
    cin>>n;
    int cnt=0, sum=0;
    for(int i=0; i<n; i++) {
        int x;
        cin>>x;
        sum+=x;
        if(sum%2==0) {
            sum=0;
            cnt++;
        }
    }

    if(sum%2==0) cout<<cnt<<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 16:20:56
Judged At
2024-11-11 03:39:00
Judged By
Score
100
Total Time
10ms
Peak Memory
568.0 KiB