// Runtime: 1 ms, faster than 98.97% of Java online submissions for Queens That Can Attack the King.
// Memory Usage: 36.5 MB, less than 100.00% of Java online submissions for Queens That Can Attack the King.


class Solution {
    public List<List<Integer>> queensAttacktheKing(int[][] queens, int[] king) {
        boolean[][] fields = new boolean[8][8];
        for (int[] queen : queens) {
            fields[queen[0]][queen[1]] = true;
        }

        List<List<Integer>> result = new ArrayList<>();
        for (int[] queen : queens) {
            if (canAttack(queen, king, fields)) {
                List<Integer> q = new ArrayList<>();
                q.add(queen[0]);
                q.add(queen[1]);
                result.add(q);
            }
        }
        return result;
    }

    boolean canAttack(int[] queen, int[] king, boolean[][] fields) {
        int x = queen[0];
        int y = queen[1];
        int k = king[0];
        int l = king[1];

        if (x == k) {
            if (y < l) {
                for (int i = y + 1; i < l; i++) {
                    if (fields[x][i]) {
                        return false;
                    }
                }
            } else {
                for (int i = y - 1; i > l; i--) {
                    if (fields[x][i]) {
                        return false;
                    }
                }
            }
            return true;
        }
        if (y == l) {
            if (x < k) {
                for (int i = x + 1; i < k; i++) {
                    if (fields[i][y]) {
                        return false;
                    }
                }
            } else {
                for (int i = x - 1; i > k; i--) {
                    if (fields[i][y]) {
                        return false;
                    }
                }
            }
            return true;
        }

        if (Math.abs(x - k) == Math.abs(y - l)) {
            int j = 1;
            if ((x - k) < 0) {
                if ((y - l) >= 0) {
                    j *= -1;
                }
                for (int i = 1; i < k - x; i++) {
                    if (fields[x + i][y + i*j]) {
                        return false;
                    }
                }

            } else {
                if ((y - l) >= 0) {
                    j *= -1;
                }
                for (int i = 1; i < x - k; i++) {
                    if (fields[x - i][y + i*j]) {
                        return false;
                    }
                }

            }
            return true;
        }

        return false;
    }
}