/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 328.0 KiB
#2 Wrong Answer 1ms 328.0 KiB
#3 Accepted 1ms 328.0 KiB
#4 Wrong Answer 1ms 312.0 KiB
#5 Wrong Answer 1ms 328.0 KiB
#6 Wrong Answer 1ms 328.0 KiB
#7 Wrong Answer 1ms 284.0 KiB
#8 Wrong Answer 1ms 332.0 KiB
#9 Wrong Answer 20ms 812.0 KiB
#10 Wrong Answer 19ms 796.0 KiB
#11 Wrong Answer 19ms 816.0 KiB
#12 Wrong Answer 1ms 284.0 KiB
#13 Wrong Answer 1ms 328.0 KiB
#14 Wrong Answer 16ms 808.0 KiB
#15 Wrong Answer 16ms 812.0 KiB
#16 Wrong Answer 15ms 804.0 KiB

Code

#include <stdio.h>

int main() {
    int N;
    scanf("%d", &N);

    int arr[N];
    for (int i = 0; i < N; i++) {
        scanf("%d", &arr[i]);
    }

    int sub_arrays = 0;
    int sum = 0;
    for (int i = 0; i < N; i++) {
            sum += arr[i];
        if (sum % 2 != 0 || (i == N - 1 && sum % 2 == 0)) {
            sub_arrays++;
            sum = 0;
        }
    }
     printf("%d\n", sub_arrays);

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Contest
TLE_Headquarters - round #1
Language
C99 (GCC 13.2.0)
Submit At
2024-03-27 17:32:17
Judged At
2024-10-03 13:55:51
Judged By
Score
15
Total Time
20ms
Peak Memory
816.0 KiB