/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 328.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 492.0 KiB
#4 Accepted 1ms 316.0 KiB
#5 Accepted 2ms 492.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 504.0 KiB
#8 Accepted 1ms 540.0 KiB
#9 Accepted 11ms 1.594 MiB
#10 Accepted 11ms 1.645 MiB
#11 Accepted 11ms 1.578 MiB
#12 Accepted 1ms 576.0 KiB
#13 Accepted 1ms 540.0 KiB
#14 Accepted 8ms 1.664 MiB
#15 Accepted 9ms 1.648 MiB
#16 Accepted 9ms 1.668 MiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;
void s()
{
    int n;
    cin >> n;
    vector<int>v;
    for(int i=0;i<n;i++) {
        int x;
        cin >> x;
        v.push_back(x);
    }

    int ans = 0, sum = 0;

    for(int i=0;i<n;i++) {
        sum+=v[i];
        if(sum%2==0) {
            ans++;
            sum = 0;
        }
    }
    if(sum!=0){
        cout << "-1" << endl;
        return;
    }
    cout << ans << endl;
}
int32_t main()
{   ios::sync_with_stdio(false);

    //TC
    s();


}




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:14:19
Judged At
2024-03-27 16:14:19
Judged By
Score
100
Total Time
11ms
Peak Memory
1.668 MiB