Submission #1989734


Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

int descending_compare(const void *a, const void *b){
    if (*(int*)a > *(int*)b){
        return -1;
    }else if (*(int*)a == *(int*)b){
        return 0;
    }else{
        return 1;
    }
}

int ascending_compare(const void *a, const void *b){
    if (*(int*)a < *(int*)b){
        return -1;
    }else if (*(int*)a == *(int*)b){
        return 0;
    }else{
        return 1;
    }
}


int lower_bound(int *a, int n, int key){
    int left, mid, right;
    left = 0, right = n;
    mid = (left + right)/2;
    while ((left+1 != mid || mid+1 != right) && mid != left){
        if (key > a[mid]){
            left = mid;
        }else{
            right = mid+1;
        }
        mid = (left + right)/2;
    }
    if (a[left] >= key)return left;
    if (a[mid] >= key)return mid;
    if (a[right] >= key)return right;
    return n;
}

//greatest common divisor
unsigned long  gcd(unsigned long x, unsigned long y){
    if (y == 0){ 
        return x;
    }else if (x > y){
        return gcd(y, x % y);
    }else{
        return gcd(x, y % x);
    }
}



long long factorial(int x){
    long long rtn = 1;
    int i;
    for (i = x; i > 1; i--){
        rtn = (rtn*i);
    }
    return rtn;
}

long long a[100005];

int main(void){
    int n;
    int start = 0;
    long long ans = 0;
    long long sum;
    scanf("%d", &n);
    for (int i = 0; i < n; i++){
        scanf("%lld", &a[i]);
    }
    if (a[start] == 0){
        ans++;
        start++;
    }
    if (start != 0){
        sum = -1*llabs(a[start])/a[start];
    }else{
        sum = a[start];
        start++;
    }

    for (int i = start; i < n; i++){
        if (sum+a[i] == 0){
            sum = (-1*llabs(sum)/sum);
            ans++;
        }else if (llabs(sum+a[i])/(sum+a[i]) == llabs(sum)/sum){
            ans += llabs(a[i] - ((-1*llabs(sum)/sum) - sum));
            sum = (-1*llabs(sum)/sum);
        }else{
            sum += a[i];
        }
    }

    printf("%lld\n", ans);

    return 0;
}

Submission Info

Submission Time
Task C - Sequence
User Morifo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2156 Byte
Status WA
Exec Time 16 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:74:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:76:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &a[i]);
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 9
WA × 9
Set Name Test Cases
Sample 00-00.txt, 00-01.txt, 00-02.txt
All 00-00.txt, 00-01.txt, 00-02.txt, 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt
Case Name Status Exec Time Memory
00-00.txt AC 1 ms 384 KB
00-01.txt AC 1 ms 128 KB
00-02.txt AC 1 ms 128 KB
01-00.txt WA 16 ms 896 KB
01-01.txt AC 16 ms 896 KB
01-02.txt WA 15 ms 896 KB
01-03.txt WA 15 ms 896 KB
01-04.txt WA 14 ms 896 KB
01-05.txt WA 13 ms 768 KB
01-06.txt WA 15 ms 896 KB
01-07.txt AC 14 ms 896 KB
01-08.txt AC 16 ms 896 KB
01-09.txt WA 14 ms 896 KB
01-10.txt WA 12 ms 768 KB
01-11.txt AC 15 ms 896 KB
01-12.txt AC 16 ms 896 KB
01-13.txt WA 14 ms 896 KB
01-14.txt AC 16 ms 896 KB