/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 400.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Accepted 1ms 320.0 KiB
#5 Accepted 1ms 324.0 KiB
#6 Accepted 1ms 320.0 KiB
#7 Accepted 1ms 324.0 KiB
#8 Accepted 1ms 324.0 KiB
#9 Accepted 32ms 920.0 KiB
#10 Accepted 32ms 924.0 KiB
#11 Accepted 32ms 928.0 KiB
#12 Accepted 1ms 616.0 KiB
#13 Accepted 1ms 440.0 KiB
#14 Accepted 16ms 924.0 KiB
#15 Accepted 17ms 924.0 KiB
#16 Accepted 16ms 832.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 1e4 + 3, mod = 1e9 + 7;

int32_t main()
{

    //fast
    int n;
    cin >> n;
    int ar[n];
    for(int i = 0; i < n; i++)cin >> ar[i];
    int cnt = 0;
    int64_t sum = 0;
    for(int i = 0; i < n; i++)
    {
        sum += ar[i];
        if(sum % 2 == 0)cnt++, sum = 0;
    }
    if(sum % 2 == 0)cout << cnt << endl;
    else cout << -1 << endl;
}

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-08 15:18:30
Judged At
2024-11-11 02:22:45
Judged By
Score
100
Total Time
32ms
Peak Memory
928.0 KiB