CH09 搜索

例题9.1 Catch That Cow

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN=100001;
struct Status{
	int n,t;
}; 
bool visit[MAXN];
int bfs(int n,int k){
	queue<Status> q;
	q.push({n,0});
	visit[n]=true;
	while(q.size()){
		Status current=q.front();
		q.pop();
		if(current.n==k){
			return current.t;
		}
		for(int i=0;i<3;i++){
			Status next;
			next.n=current.n;
			next.t=current.t+1;
			if(i==0){
				next.n+=1;
			}
			else if(i==1){
				next.n-=1;
			}
			else{
				next.n*=2;
			}
			if(next.n<0||next.n>=MAXN||visit[next.n]){
				continue;
			}
			q.push(next);
			visit[next.n]=true;
		}
	}
	return -1;
}
int main(){
	int n,k;
	cin>>n>>k;
	memset(visit,false,sizeof visit);
	cout<<bfs(n,k)<<endl;
}

习题9.1 玛雅人的密码(THU)

#include<bits/stdc++.h>
using namespace std;
struct node{
	int index;
	string s;	
};
void bfs(string s){
	queue<node> q;
	q.push({0,s});
	while(q.size()){
		node t=q.front();
		q.pop();
		string ts=t.s;
		if(ts.find("2012")!=string::npos){
			cout<<t.index<<endl;
			return;
		}
		for(int i=0;i<ts.size()-1;i++){
			swap(ts[i],ts[i+1]);
			q.push({t.index+1,ts});
			swap(ts[i],ts[i+1]);
		}
	}
	cout<<-1<<endl;
}
int main(){
	int n;
	string s;
	while(cin>>n>>s){
		bfs(s);
	}
}

例题9.3 A Knight’s Journey(POJ 2488)

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
const int MAXN=30;
int p,q;
bool visit[MAXN][MAXN];
int direction[8][2]={
	{-1,-2},{1,-2},{-2,-1},{2,-1},{-2,1},{2,1},{-1,2},{1,2} 
};
bool dfs(int x,int y,int step,string ans){
	if(step==p*q){
		cout<<ans<<endl<<endl;
		return true;
	}
	for(int i=0;i<8;i++){
		int nx=x+direction[i][0];
		int ny=y+direction[i][1];
		char col=ny+'A';
		char row=nx+'1';
		if(nx<0||nx>=p||ny<0||ny>=q||visit[nx][ny]){
			continue;
		}
		visit[nx][ny]=true;
		if(dfs(nx,ny,step+1,ans+col+row)){
			return true;
		}
		visit[nx][ny]=false;
	}
	return false;
}
int main(){
	int n;
	cin>>n;
	int caseNumber=0;
	while(n--){
		cin>>p>>q;
		memset(visit,false,sizeof visit);
		cout<<"Scenario #"<<++caseNumber<<":"<<endl;
		visit[0][0]=true;
		if(!dfs(0,0,1,"A1")){
			cout<<"impossible"<<endl<<endl;
		}
	}
} 

例题9.4 Square(POJ2362)

#include<iostream>
#include<algorithm>
#include<cstring> 
using namespace std;
const int MAXN=25;
int side;//边长
int m;
int sticks[MAXN];
bool vis[MAXN];
bool dfs(int sum,int number,int pos){
	if(number==3){
		return true;
	}
	int sample=0;
	for(int i=pos;i<m;i++){
		if(vis[i]||sum+sticks[i]>side||sticks[i]==sample){
			continue;
		}
		vis[i]=true;
		if(sum+sticks[i]==side){//凑成一条边 
			if(dfs(0,number+1,0)){
				return true;
			}
			else{
				sample=sticks[i];//记录失败棍子的长度 
			}
		}
		else{
			if(dfs(sum+sticks[i],number,i+1)){
				return true;
			}
			else{
				sample=sticks[i];
			}
		}
		vis[i]=false; 
	}
	return false;
} 
int n;
int main(){
	cin>>n;
	while(n--){
		int length=0;
		cin>>m;
		for(int i=0;i<m;i++){
			cin>>sticks[i];
			length+=sticks[i];
		}
		memset(vis,false,sizeof vis);
		if(length%4!=0){
			cout<<"no"<<endl;
			continue;
		}
		side=length/4;
		sort(sticks,sticks+m,greater<int>());
		if(sticks[0]>side){
			cout<<"no"<<endl;
			continue;
		}
		if(dfs(0,0,0)){
			cout<<"yes"<<endl;
		}
		else{
			cout<<"no"<<endl; 
		}
	} 
} 

习题9.2 神奇的口袋(PKU)

#include<bits/stdc++.h>
using namespace std;
int n,arr[30],ans;
void dfs(int tot,int x){
	if(tot==40){
		ans++;
		return;
	}
	for(int i=x;i<n;i++){
		if(tot+arr[i]<=40){
			dfs(tot+arr[i],i+1);
		}		
	}
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	dfs(0,0);
	cout<<ans<<endl;
}

习题9.3 八皇后(PKU)

#include<bits/stdc++.h>
using namespace std;
vector<string> v;
bool check(int A[8],int n,int cur,int pos){
    for(int i=1;i<cur;i++){
        if(pos-i>=1&&A[cur-i]==pos-i){
            return false;
        }
        if(pos+i<=n&&A[cur-i]==pos+i){
            return false;
        }
        if(A[cur-i]==pos){
            return false;
        }
    }
    return true;
}
void permutation(int A[8],int cur,int n){ 
    if(cur==n+1){
        string s;
        for(int i=1;i<=8;i++){
			s+=to_string(A[i]);
        } 
        v.push_back(s); 
        return;
    }
    for(int i=1;i<=8;i++){
        bool ok=true;
        if(check(A,n,cur,i)){
            ok=false;
            A[cur]=i;
            permutation(A,cur+1,n);
        }       
    }
}
int b;
int A[9];
int main(){
	permutation(A,1,8);
	cin>>b;
	cout<<v[b-1]<<endl;	
}