/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 324.0 KiB
#5 Accepted 1ms 320.0 KiB
#6 Accepted 1ms 324.0 KiB
#7 Accepted 1ms 328.0 KiB
#8 Accepted 1ms 404.0 KiB
#9 Accepted 11ms 1.312 MiB
#10 Accepted 11ms 1.309 MiB
#11 Accepted 11ms 1.316 MiB
#12 Accepted 1ms 532.0 KiB
#13 Accepted 1ms 532.0 KiB
#14 Accepted 9ms 1.312 MiB
#15 Accepted 9ms 1.066 MiB
#16 Accepted 9ms 1.316 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 ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{
    int n;
    cin>>n;
    vector<int>v(n);
    for(int i=0; i<n; i++)cin>>v[i];

    int cnt = 0;
    int sum= 0;
    int sumall=0;
    for (auto it : v)
    {
        sum += it;
        sumall += it;
        if (sum % 2 == 0)
        {
            cnt++;
            sum = 0;
        }
    }
    if(sumall%2!=0)cout<<"-1"<<endl;
    else cout<<cnt<<endl;
}
int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
    //TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}




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:19:50
Judged At
2024-11-11 03:39:03
Judged By
Score
100
Total Time
11ms
Peak Memory
1.316 MiB