摘要:
1 #include<stdio.h> 2 #include<string.h> 3 const int N = 30; 4 char map[N][N]; 5 struct node { 6 int dir, x, y, time, color; 7 }q[N * N * 5 * 4 * 10], cur, next, start, end; 8 int m, n; 9 bool judge(node cur) { 10 if(cur.x >=0 && cur. x < m && cur.y >=0 && 阅读全文