A-P1219 八皇后问题
#include<bits/stdc++.h>
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
const int N = 100;
//好吧这种方法不太行 必须要把地图存成四个数组 或者一个二维是4的数组才行
//这样能记录 四条对角线的状态
int n,cnt;
int table[N][N];
int vis[N][N];
int ans[N],b[N],c[N],d[N];
//ans数组表示的是行;
//b数组表示的是列;
//c表示的是左下到右上的对角线;
//d表示的是左上到右下的对角线;
int check(int x,int y){
if(x < 1 || x > n)return 0;
if(y < 1 || y > n)return 0;
return 1;
}
void paint(int x,int y){
int a,b;
a = min(n - x,n - y);
b = min(x - 1,y - 1);
for(int i = 1;i <= n;i++)vis[x][i] == true;
for(int i = 1;i <= n;i++)vis[i][y] == true;
for(int i = 1;i <= a;i++)vis[x + i][y + i] == true;
for(int i = 1;i <= b;i++)vis[x - i][y - i] == true;
}
void DFS(int x){
if(x > n){
cnt++;
if(cnt <= 3){
for(int i = 1;i < n;i++)cout<<ans[i]<<" ";
cout<<ans[n]<<endl;
}
return;
}
for(int i = 1;i <= n;i++){//尝试所有可能
if(!b[i] && !c[x + i] && !d[x - i + n]){
ans[x] = i;
b[i] = 1;
c[x + i] = 1;
d[x - i + n] = 1;
DFS(x + 1);
b[i] = 0;
c[x + i] = 0;
d[x - i + n] = 0;//三步回溯
}
}
}
int main(){
cin>>n;
DFS(1);
cout<<cnt;
return 0;
}
B-H1045 Fire Net
#include<bits/stdc++.h>
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
const int N = 15;
int n,ans;
char table[N][N];
int dir[][2] = {{0,1},{1,0},{0,-1},{-1,0}};
int check(int x,int y){
if(table[x][y] != '.')return 0;
int dx,dy;
for(int i = 0;i < 4;i++){
dx = x + dir[i][0];
dy = y + dir[i][1];
while(true){
if(dx < 1 || dx > n || dy < 1 || dy > n || table[dx][dy] == 'X')break;
else if(table[dx][dy] == '1')return 0;
dx += dir[i][0], dy += dir[i][1];
}
}
return 1;
}
void DFS(int num){
ans = max(ans,num);
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(check(i,j)){
table[i][j] = '1';
DFS(num + 1);
table[i][j] = '.';
}
}
}
}
int main(){
while(scanf("%d",&n) && n){
ans = 0;
for(int i = 1;i <= n;i++)for(int j = 1;j <= n;j++)cin>>table[i][j];
DFS(0);
cout<<ans<<endl;
}
return 0;
}
C-H1010 Tempter of the Bone
#include<cstring>
#include<iostream>
#include<cmath>
#define ms(a,b) memset(a,b,sizeof(a))
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
const int N = 15;
//奇偶剪枝
int n,m,t,sx,sy,fx,fy,ans;
char table[N][N];
bool vis[N][N];
int dir[][2] = {{0,1},{1,0},{0,-1},{-1,0}};
void DFS(int x,int y,int step){
//出口
if(x < 1 || x > n)return;
if(y < 1 || y > m)return;
if(table[x][y] == 'D' && step == t){
ans = 1;
return;
}
//剪枝 光剪枝还不够...
if(abs(x - fx) + abs(y - fy) > t - step)return;//步数不够
if((t - step) % 2 != (abs(x - fx) + abs(y - fy)) % 2)return;//奇偶性不同
//搜索
vis[x][y] = true;
for(int i = 0;i <= 3;i++){
int dx,dy;
dx = x + dir[i][0],dy = y + dir[i][1];
if(table[dx][dy] != 'X' && !vis[dx][dy] && !ans){//!ans 表示如果成功了就直接停止搜素
DFS(dx,dy,step + 1);
vis[dx][dy] = false;
}
}
}
int main(){
FAST;
while(cin>>n>>m>>t && n && m && t){
//初始化
ans = 0;
ms(vis,false);
for(int i = 1;i <= n;i++)
for(int j = 1;j <= m;j++){
cin>>table[i][j];
if(table[i][j] == 'S')sx = i,sy = j;
if(table[i][j] == 'D')fx = i,fy = j;
}
//搜索
DFS(sx,sy,0);
//输出
if(ans)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
D-H1035 Robot Motion
#include<iostream>
#include<cstring>
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
const int N = 15;
int n,m,start;
int step,extra;
char table[N][N];
int vis[N][N];
//int dir[][2] = {{0,1},{1,0},{0,-1},{-1,0}};
int check(int x,int y){
if(x < 1 || x > n)return 0;
if(y < 1 || y > m)return 0;
return 1;
}
void DFS(int x,int y){
if(!check(x,y)){
cout<<step<<" step(s) to exit"<<endl;
return;
}
if(vis[x][y] == 1)extra++;
if(vis[x][y] == 2){
cout<<step - 2 * extra<<" step(s) before a loop of "<<extra<<" step(s)"<<endl;
return;
}
step++;
vis[x][y]++;
if(table[x][y] == 'N')DFS(x - 1,y);
if(table[x][y] == 'S')DFS(x + 1,y);
if(table[x][y] == 'W')DFS(x,y - 1);
if(table[x][y] == 'E')DFS(x,y + 1);
}
int main(){
while(scanf("%d %d",&n,&m) && n != 0 && m != 0){
scanf("%d",&start);
step = 0,extra = 0;
ms(vis,0);
for(int i = 1;i <= n;i++)for(int j = 1;j <= m;j++)cin>>table[i][j];
DFS(1,start);
}
return 0;
}
我死会儿…