The problem is in the map ,
Don't use map. It has happened with me too , see here : 212775377

if (x != y) {
    if (h[x] != h[y]) {
        b = false;
        break;
    }
}

in this part of the code when h[y] does not exist, it inserts {y, 0} into the map. this previous y is later iterated as an x which does not exist in our original array but one which in there in our map. this can be avoided with a continue statement when cnt = 0. the time complexity can also be further improved as max(sides) * min(sides) is the only area for which we can get an YES value.

ac submission using this logic: 217060530