/ SeriousOJ /

Record Detail

Accepted


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

Code

#include<bits/stdc++.h>
typedef long long   ll;
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout<<it<<" "; cout<<endl;
#define _ASRafi__   ios::sync_with_stdio(false); cin.tie(0);
using namespace std;

void solve()
{
    ll n, m, k, c = 0, ans = 0;
    cin >> n;
    vector<ll> v(n);
    for (int i = 0; i < n; i++)
    {
        ll x; cin >> x;
        v[i] = x;
        c += x;
        if(c & 1) continue;
        ++ans;
        c = 0;
    }
    if(ans == 0 or c != 0) cout << -1 << endl;
    else cout << ans << endl;
    return;
}

int32_t main()
{
    _ASRafi__;
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++)
    {
        // cout << "Case " << t << ": ";
        solve();
    }
    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 16:22:11
Judged At
2024-11-11 03:38:59
Judged By
Score
100
Total Time
10ms
Peak Memory
1.32 MiB