Manhattan sightseeing

input/code.cpp: In function 'coord bin_s(uint64_t, uint64_t, uint64_t, uint64_t)':
input/code.cpp:36:14: warning: unused variable 's' [-Wunused-variable]
   36 |     uint64_t s = score(mid_x, mid_y, &dif_i);
      |              ^

#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <inttypes.h>
uint64_t *x;
uint64_t *y;
uint64_t n;

struct coord{
    uint64_t x;
    uint64_t y;
};

uint64_t score(uint64_t my_x, uint64_t my_y, uint64_t *max_i){
    uint64_t maxs = 0;
    uint64_t nb = 0;
    *max_i = 0;
    for (uint64_t i = 0; i < n; i++){
         nb = labs(x[i] - my_x) + labs(y[i] - my_y);
         *max_i = (nb > maxs) ? i : *max_i;
         maxs = (nb > maxs) ? nb : maxs;
    }
    // printf("mins = %ld\n", maxs);
    return maxs;
}

struct coord bin_s(uint64_t min_x, uint64_t max_x, uint64_t min_y, uint64_t max_y){
    if (max_x - min_x <=1 && max_y - min_y <= 1){
        return {min_x, min_y};
    }
    uint64_t dif_i = 0;
    uint64_t mid_x = (min_x+max_x)/2;
    uint64_t mid_y = (min_y+max_y)/2;
    uint64_t s = score(mid_x, mid_y, &dif_i);
    if (mid_x < x[dif_i])
        min_x = mid_x;
    else
        max_x = mid_x;
    if (mid_y < y[dif_i])
        min_y = mid_y;
    else
        max_y = mid_y;
    return bin_s(min_x, max_x, min_y, max_y);
}

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

    x = (uint64_t*) malloc(n * sizeof(uint64_t));
    y = (uint64_t*) malloc(n * sizeof(uint64_t));

    // main algo

    uint64_t minx = UINT64_MAX;
    uint64_t miny = UINT64_MAX;
    uint64_t maxx = 0;
    uint64_t maxy = 0;

    for (uint64_t i = 0; i < n; i++){
        // printf("minx:%lu miny:%lu maxx:%lu maxy:%lu\n", minx, miny, maxx, maxy);
        if (scanf("%lu %lu", x + i, y + i) == 0)
            return EXIT_FAILURE;
        // printf("x:%ld y:%ld", x[i], y[i]);
        minx = (minx < x[i]) ? minx : x[i];
        miny = (miny < y[i]) ? miny : y[i];
        maxx = (maxx > x[i]) ? maxx : x[i];
        maxy = (maxy > y[i]) ? maxy : y[i];
        // printf("minx:%lu miny:%lu maxx:%lu maxy:%lu\n", minx, miny, maxx, maxy);
    }

    struct coord res = bin_s(minx, maxx, miny, maxy);
    uint64_t midx = res.x;
    uint64_t midy = res.y;
    uint64_t resx = res.x;
    uint64_t resy = res.y;

    // printf("minx:%ld miny:%ld maxx:%ld maxy:%ld\n", minx, miny, maxx, maxy);

    // printf("%ld %ld\n", midx, midy);
    uint64_t mini = 9999999999;
    uint64_t tmp = 0;

    if (score(midx + 1, midy, &tmp) < mini){
        mini = score(midx + 1, midy, &tmp);
        // printf("bmins = %ld\n", mini);
        resx = midx + 1;
        resy = midy;
    }
    if (score(midx, midy + 1, &tmp) < mini){
        mini = score(midx, midy + 1, &tmp);
        // printf("cmins = %ld\n", mini);
        resx = midx;
        resy = midy + 1;
    }
    if (score(midx + 1, midy + 1, &tmp) < mini){
        mini = score(midx + 1, midy + 1, &tmp);
        // printf("dmins = %ld\n", mini);
        resx = midx + 1;
        resy = midy + 1;
    }

    printf("%ld %ld\n", resx, resy);


    return EXIT_SUCCESS;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED

Test 75

Verdict: ACCEPTED

Test 76

Verdict: ACCEPTED

Test 77

Verdict: ACCEPTED