/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 540.0 KiB
#2 Accepted 2ms 328.0 KiB
#3 Accepted 2ms 544.0 KiB
#4 Accepted 2ms 492.0 KiB
#5 Accepted 2ms 564.0 KiB
#6 Accepted 2ms 492.0 KiB
#7 Accepted 2ms 328.0 KiB
#8 Accepted 2ms 528.0 KiB
#9 Accepted 17ms 1.277 MiB
#10 Accepted 17ms 1.074 MiB
#11 Accepted 17ms 1.309 MiB
#12 Accepted 2ms 328.0 KiB
#13 Accepted 2ms 516.0 KiB
#14 Accepted 13ms 1.324 MiB
#15 Accepted 12ms 1.074 MiB
#16 Accepted 12ms 1.32 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v)  v.begin(),v.end()
const int mod = 1e9 + 7;

void solve(){
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i=0; i<n; i++){
        cin >> v[i];
    }
    int cnt = 0;
    bool flag = 1;
    bool first = 1;
    for (int i=0; i<n; i++){
        if ((v[i] % 2 == 0) and (flag))
            cnt++;
        if ((v[i] % 2 != 0) and (first)){
            flag = 0;
            first = 0;
            continue;
        }
        if ((v[i] % 2 != 0) and (!first)){
            flag = 1;
            first = 1;
            cnt++;
        }
    }
    (flag) ? cout << cnt << endl : cout << -1 << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

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:46:31
Judged At
2024-11-11 03:38:07
Judged By
Score
100
Total Time
17ms
Peak Memory
1.324 MiB