import java.util.*; public class Main{ static Point[] po; static int[][] b; static boolean bo = false; public void dfs(int[][] a, int count, int p, int x, int y) { int n = a.length; int m = a[0].length; if (x == 0 && y == m -1) { if (p >= 0) { bo = true; System.out.print("[0,0],"); for (int i = 0; i < count - 1; i ++) { System.out.print("["+po[i].x+","+po[i].y+"],"); } System.out.println("["+po[count - 1].x+","+po[count - 1].y+"]"); } } else { if ((x >= 0 && x < n)&&(y >= 0 && y < m - 1)&&a[x][y + 1] != 0&&b[x][y+1] == 0) { y++; count++; p--; Point point = new Point(x, y); po[count - 1] = point; b[x][y] = 1; dfs(a, count, p,x,y); b[x][y] = 0; y--; count--; p++; po[count] = null; } else if ((x > 0 && x < n)&&(y >= 0 && y < m)&&a[x - 1][y] != 0&&b[x-1][y] == 0) { x--; count++; p = p - 3; Point point = new Point(x, y); po[count - 1] = point; b[x][y] = 1; dfs(a, count, p,x,y); b[x][y] = 0; x++; count--; p = p + 3; po[count] = null; } else if ((x >= 0 && x < n - 1)&&(y >= 0 && y < m)&&a[x + 1][y] != 0&&b[x + 1][y] == 0) { x++; count++; Point point = new Point(x, y); po[count - 1] = point; b[x][y] = 1; dfs(a, count, p,x,y); b[x][y] = 0; x--; count--; po[count] = null; } } } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int p = sc.nextInt(); int[][] a = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) a[i][j] = sc.nextInt(); } Main tutle = new Main(); tutle.po = new Point[10000]; tutle.b = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) tutle.b[i][j] = 0; } tutle.b[0][0] = 1; tutle.dfs(a,0,p,0,0); if (!tutle.bo) { System.out.println("Can not escape!"); } } } class Point { int x; int y; Point(int x, int y) { this.x = x; this.y = y; } } 写的好丑，也没有添加最优判断但还是ac了，只能说测试用例比较好过。