/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Wrong Answer 1ms 324.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Wrong Answer 1ms 320.0 KiB
#5 Wrong Answer 1ms 516.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Wrong Answer 1ms 348.0 KiB
#8 Wrong Answer 1ms 536.0 KiB
#9 Wrong Answer 29ms 928.0 KiB
#10 Wrong Answer 30ms 932.0 KiB
#11 Wrong Answer 29ms 836.0 KiB
#12 Accepted 1ms 320.0 KiB
#13 Wrong Answer 1ms 324.0 KiB
#14 Wrong Answer 16ms 928.0 KiB
#15 Wrong Answer 16ms 832.0 KiB
#16 Wrong Answer 17ms 924.0 KiB

Code

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int main() {


    int n;
    cin >> n;

    vector<int> A(n);
    for (int i = 0; i < n; i++) {
        cin>>A[i];
    }

    int odd_count = 0,even_count=0;
    for (int i = 0; i < n; ++i) {
        if (A[i] % 2 == 1) {
            odd_count++;
        }
        else
            even_count++;
    }

         if(odd_count==0){
            cout<<(n*(n+1))/2<<endl;

    }
        else if(even_count==0)
    {
            cout<<n-1<<endl;

    }
        else if(even_count!=0 && odd_count!=0) {

        cout << odd_count + 1 << endl;

    }
        else{
            cout<<-1<<endl;
        }

    return 0;
}

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 18:17:08
Judged At
2024-10-03 13:55:17
Judged By
Score
25
Total Time
30ms
Peak Memory
932.0 KiB