Accepted
Code
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.hpp"
#else
#define bug(...)
#endif
typedef long long ll;
#define endl "\n"
#define ws " "
#define yy cout<<"YES\n";
#define nn cout<<"NO\n";
signed main(){
int tc=0, tcMax=1;
// cin >> tcMax;
while (tc++<tcMax) {
// bug(tc);
int n;
cin>>n;
int tot = 0;
vector<int> ara(n);
for(int i = 0; i < n; i++){
cin>>ara[i];
tot+=ara[i];
}
if(tot % 2){
cout<<-1<<endl;
continue;
}
int count = 0;
int sw = 0;
for(int i = 0; i < n; i++){
if(ara[i]%2){
if(sw == 1){
count++;
sw = 0;
}else{
sw = 1;
}
}else if(ara[i]%2 == 0 && sw == 0){
count++;
}
}
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 17:14:28
- Judged At
- 2024-11-11 03:37:40
- Judged By
- Score
- 100
- Total Time
- 32ms
- Peak Memory
- 928.0 KiB