welcome_z的专栏

#include #include #include #define N 10 using namespace std; int move[4][2] = {-1,0,0,-1,0,1,1,0}; //{0,-1,-1,0,1,0,0,1} 109ms; //{-1,0,0,-1,0,1,1,0} 46ms; //{0,1,1,0,0,-1,-1,0} 62ms; //{0,1,1,0,-

#include using namespace std; short s[66]; bool v[66]; short k, n, m, t, r; bool su; void dfs(short x, short l) { if (su) return ; if (x==0) { x = r; l--; } if (l==0) { su = true; retur

#include #include #define n(x) x - 'a' #define clr(x, k) memset((x), (k), sizeof(x)) using namespace std; const int N = 30; bool v[N], f; int head[N]; struct edge { int e, next; }e[N]; //数据弱爆了 in

#include #include #include #include using namespace std; map > Map; set used; bool read(int &num, int n) { int i, t; num = 0; for (i=0;i<n;++i) { scanf("%d", &t); if (t==-1) return fal

不要有侥幸心理，能剪的都剪了再交。 #include using namespace std; int s[23], n, m, k, l; bool f, v[23]; void dfs(int l, int u, int c) { if (l==0) l = k, u = m-1, c++; if (c>2) f = 1; if (f) retu

dfs: #include using namespace std; short d[4][2] = {1,0,0,1,-1,0,0,-1}; char g[110][110]; int n, m, ans; void dfs(int i, int j) { g[i][j] = '.'; for (int k=0;k<4;++k) { int x = i +