import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

public class Map {
    private char[][] map;
    private int[][] mapValue;
    private int m, n, shortlyWayCount;
    private boolean isLoaded;

    public Map(int m, int n) {
        this.m = m;
        this.n = n;
        map = new char[n][m];
        mapValue = new int[n][m];
        isLoaded = false;
    }

    public int getShortlyWayCount() {
        return shortlyWayCount;
    }

    public void setShortlyWayCount(int shortlyWayCount) {
        this.shortlyWayCount = shortlyWayCount;
    }

    public void printMap() throws IOException {
        if (!isLoaded)
            loadMapFromFile();
        print();
    }

    public void printMapValue() throws IOException{
        if (!isLoaded)
            loadMapFromFile();
        System.out.println("\nPrint mapValue:");
        print();
    }

    private void print() {
        boolean printMap = false;
        if (Thread.currentThread().getStackTrace()[Thread.currentThread().getStackTrace().length - 2].getMethodName().equals("printMap"))
            printMap = true;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (printMap)
                    System.out.print(map[i][j] == ';' ? "\u001B[30;42m"  + map[i][j] + "\u001B[0m": map[i][j]);
                else
                    System.out.print(mapValue[i][j] < 9999 ? (mapValue[i][j] < 10 ? " " + mapValue[i][j] : mapValue[i][j] + "" ) : "-1");
            }
            System.out.println();
        }
    }

    public void loadMapFromFile() throws IOException {
        BufferedReader fileReader = new BufferedReader(new FileReader("map.txt"));
        readFromFile(fileReader);
        fileReader.close();

        isLoaded = true;
    }

    private void readFromFile(BufferedReader fileReader) throws IOException {
        int numberOfReadedLine = 0;
        while (fileReader.ready()) {
            map[numberOfReadedLine] = fileReader.readLine().toCharArray();
            numberOfReadedLine++;
        }
    }

    public int searchShortlyWay(int i, int j) {
        if (isFirst(i, j))
            return 1;
        if (isDeadline(i, j))
          return 9999;
        if (mapValue[i][j] != 0)
            return mapValue[i][j] + 1;

        mapValue[i][j] = 9999;
        int upValue = i > 0 ? searchShortlyWay(i - 1, j) : 9999;
        int downValue = i < n - 1 ? searchShortlyWay(i + 1, j) : 9999;
        int leftValue = j > 0 ? searchShortlyWay(i, j - 1) : 9999;
        int rightValue = j < n - 1 ? searchShortlyWay(i, j + 1) : 9999;
        int result = 1 + Integer.min(Integer.min(upValue, downValue), Integer.min(rightValue, leftValue));
        mapValue[i][j] = (char)result;
        return result;
    }

    private boolean isFirst(int i, int j) {
        return (i == 0 && j == 0);
    }

    private boolean isDeadline(int i, int j) {
        return (i < 0 || i >= n || j < 0 || j >= m || map[i][j] == 'x');
    }

    public void printShortTrack() throws IOException {
        mapValue[0][0] = 1;
        int index = shortlyWayCount + 1;
        while (index > 0) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    if (mapValue[i][j] == index && map[i][j] != 'x') {
                        map[i][j] = ';';
                        index--;
                    }
                }
            }
        }
    }
}