m0_53916335的博客

题目链接 Red and Black 代码如下 #include<bits/stdc++.h> using namespace std; const int M = 22; char Map[M][M]; bool vis[M][M]; int w,h,ans; int dir[4][2] = {{0,1},{0,-1},{1,0},{-1,0}}; void dfs(int si, int sj) { if(si<1||si>w||sj<1||sj>h) retu

题目链接 Oil Deposits 代码如下 #include<bits/stdc++.h> using namespace std; int i,j,n,m; const int M = 105; int dir[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{-1,1},{1,-1},{-1,-1}}; char a[M][M]; void dfs(int si,int sj) { int di,dj; for(int k=0;k<8;k

题目链接 Tempter of the Bone 代码如下 #include<bits/stdc++.h> using namespace std; char Map[9][9]; int n,m,t,di,dj; bool escape; int dir[4][2] = {{0,-1},{0,1},{1,0},{-1,0}}; void dfs(int si,int sj,int cnt); int main () { int i,j,si,sj; while(cin>>n&g