Misc/KnightMove.h

View this file on GitHub
Last update: 2015-09-09 01:11:48+08:00
Link: https://open.kattis.com/problems/knightstrip

Code

// Knight’s shortest path (from (0, 0))
// Tested:
// - https://open.kattis.com/problems/knightstrip
int KSP(int x, int y) {
    if (x < 0) x = -x;
    if (y < 0) y = -y;
    if (x < y) swap(x, y);
    if (x == 1 && y == 0) return 3;
    if (x == 2 && y == 2) return 4;
    int d = x - y;
    if (y > d) return 2 * ((y - d + 2) / 3) + d;
    return d - 2 * ((d - y) / 4);
}

#line 1 "Misc/KnightMove.h"
// Knight’s shortest path (from (0, 0))
// Tested:
// - https://open.kattis.com/problems/knightstrip
int KSP(int x, int y) {
    if (x < 0) x = -x;
    if (y < 0) y = -y;
    if (x < y) swap(x, y);
    if (x == 1 && y == 0) return 3;
    if (x == 2 && y == 2) return 4;
    int d = x - y;
    if (y > d) return 2 * ((y - d + 2) / 3) + d;
    return d - 2 * ((d - y) / 4);
}