package problem.programmers;

import java.util.HashMap;
import java.util.Map;

class Solution_단체사진찍기 {
    private static final int FRIENDS_COUNT = 8;
    static char[] sequence;
    static boolean[] visited;
    static char[] friends;
    static int count;

    public static int solution(int n, String[] data) {
        init();
        permutation(0, data);
        return count;
    }

    private static void init() {
        sequence = new char[FRIENDS_COUNT];
        visited = new boolean[FRIENDS_COUNT];
        friends = new char[]{'A', 'C', 'F', 'J', 'M', 'N', 'R', 'T'};
        count = 0;
    }

    private static void permutation(int depth, String[] data) {
        if (depth == FRIENDS_COUNT) {
            Map<Character, Integer> lineUpInfo = lineUp();
            if (isAbleLineUp(lineUpInfo, data)) {
                count++;
            }
            return;
        }
        for (int i = 0; i < FRIENDS_COUNT; i++) {
            if (!visited[i]) {
                visited[i] = true;
                sequence[depth] = friends[i];
                permutation(depth + 1, data);
                visited[i] = false;
            }
        }
    }

    private static HashMap<Character, Integer> lineUp() {
        HashMap<Character, Integer> map = new HashMap<>();
        for (int i = 0; i < FRIENDS_COUNT; i++) {
            map.put(sequence[i], i);
        }
        return map;
    }

    private static boolean isAbleLineUp(Map<Character, Integer> lineUpInfo, String[] conditions) {
        for (int i = 0; i < conditions.length; i++) {
            if (!isCorrectToCondition(conditions[i], lineUpInfo)) {
                return false;
            }
        }
        return true;
    }

    private static boolean isCorrectToCondition(String condition, Map<Character, Integer> map) {
        char origin = condition.charAt(0);      //origin 
        char target = condition.charAt(2);      //orign과 비교대상
        char sign = condition.charAt(3);        //조건 부호
        int num = condition.charAt(4) - '0';    //조건에 해당되는 거리

        if (sign == '=') {
            int distance = Math.abs(map.get(origin) - map.get(target)) - 1;
            if (distance == num) {
                return true;
            }
        }
        if (sign == '<') {
            int distance = Math.abs(map.get(origin) - map.get(target)) - 1;
            if (distance < num) {
                return true;
            }
        }
        if (sign == '>') {
            int distance = Math.abs(map.get(origin) - map.get(target)) - 1;
            if (distance > num) {
                return true;
            }
        }
        return false;
    }
}