华为od欢快的周末

public class FunnyWeeks {
    static final int N = 110;
    static int[][] arr = new int[N][N];
    static Map<String, Integer> map1 = new HashMap<>(),map2 = new HashMap<>();
    static int[] dx = new int[]{-1, 0, 1, 0}, dy = new int[]{0, 1, 0, -1};
    static int n, m;

    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        n = cin.nextInt();
        m = cin.nextInt();
        int[] pos = new int[4];
        for (int i = 0,k = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = cin.nextInt();
                if(arr[i][j] == 2) {
                    pos[k++] = i;
                    pos[k++] = j;
                }
            }
        }
        dfs(pos[0],pos[1],map1);
        dfs(pos[2],pos[3],map2);
        int res = 0;
        if(map1.size() == 0 || map2.size() == 0) System.out.println(0);
        else {
            for(Map.Entry<String,Integer> entry : map1.entrySet()) {
                String key = entry.getKey();
                if(map2.containsKey(key)) res++;
            }
            System.out.println(res);
        }
    }

    public static void dfs(int x, int y,Map<String,Integer> map) {
        if (arr[x][y] == 3) {
            String key = get(x,y);
            map.put(key, map.getOrDefault(key, 0) + 1);
            return;
        }
        int k = arr[x][y];
        arr[x][y] = -1;
        for (int i = 0; i < 4; i++) {
            int a = dx[i] + x, b = dy[i] + y;
            if (a >= 0 && a < n && b >= 0 && b < m && arr[a][b] != 1 && arr[a][b] != -1 && !map.containsKey(get(a,b))) {
                dfs(a, b,map);
            }
        }
        arr[x][y] = k;
    }
    public static String get(int x,int y) {
        return  String.valueOf(x) + "@" + String.valueOf(y);
    }
}