/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 320.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Wrong Answer 1ms 536.0 KiB
#4 Wrong Answer 1ms 408.0 KiB

Code

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

#define ll long long int
#define ld long double
#define endl '\n'
#define fasterio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

void solve() {
    // Your code here
    ll n;
    cin>>n;
    vector<ll> v(n);
    for(ll i=0;i<n;i++) cin>>v[i];

    ll count=0,sum=0;
    for(ll i=0;i<n;i++) {
        sum+=v[i];
        if(sum%2==0) {
            count++;
            sum=0;
        }
    }
    if(n==1){
        cout<<-1<<endl;
    }else{
        cout<<count<<endl;
    
    }
}

int main() {
    fasterio;
    // Always use ll, int may give TLE
    ll t;
    // cin >> t;
    t=1;
    while (t--) {
        solve();
    }
    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:45:01
Judged At
2024-11-11 03:38:11
Judged By
Score
15
Total Time
2ms
Peak Memory
536.0 KiB