Microservice hell

#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

typedef struct cell{
    uint64_t val;
    struct cell *next;
    struct cell *prev;
} cell;

uint64_t *status;
uint64_t *values;
cell **calls;
uint64_t n, m, X;
cell *lc, *end;

void add(uint64_t id){
    cell *c = (cell*) malloc(sizeof(cell));
    c->val=id;
    if(lc != NULL){
        lc->prev = c;
    } else {
        end = c;
    }
    c->next = lc;
    c->prev = NULL;
    lc = c;
}

void explore(uint64_t id){
    // printf("test : %ld\n", id);
    if (status[id] == 1){
        printf("No\n");
        exit(EXIT_SUCCESS);
    }
    if (status[id] == 2){
        return;
    }
    status[id] = 1;
    cell *cur = calls[id];
    while (cur != NULL){
        explore(cur->val);
        cur = cur->next;
    }
    status[id] = 2;
    add(id);
}

int main() {
    if (scanf("%ld %ld %ld", &n, &m, &X) == 0)
        return EXIT_FAILURE;

    calls = (cell**) calloc(n, sizeof(cell*));

    uint64_t a, b;
    cell *c;
    for (uint64_t i = 0; i<m; i++){
        if (scanf("%ld %ld", &a, &b) == 0)
            return EXIT_FAILURE;
        a--;
        b--;
        c = (cell*) malloc(sizeof(cell));
        c->prev = NULL;
        c->next = calls[a];
        c->val = b;
        calls[a] = c;
    }

    status = (uint64_t*) calloc(n, sizeof(uint64_t));
    values = (uint64_t*) calloc(n, sizeof(uint64_t));

    for (uint64_t i = 0; i<n; i++){
        explore(i);
    }
    cell *cur = end;
    while (cur!=NULL){
        cell *tmp = calls[cur->val];
        uint64_t acc =1;
        while (tmp != NULL){
            acc += values[tmp->val];
            tmp = tmp->next;
        }
        values[cur->val] = acc;
        if (acc > X){
            printf("No\n");
            exit(EXIT_SUCCESS);
        }
        cur = cur->prev;
    }
    printf("Yes\n");




    return EXIT_SUCCESS;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED