训练总结 8.2

一、安排

   搜索题，一共做了两道。在做第一道题时，样例通不过，查了好几遍，没找出错来，尝试了各种改法，无效，整整弄了一上午。最终也没找出来哪里有错，下午重新写了一遍，跟之前的写法感觉也差不了过少，才把这道题交上。

二、题目

1、prime path

素数变换，因为只需要四位数的素数，用最笨的筛素数方法也不会超时。寻找最少步数的问题一般都用广搜。

#include<iostream>
#include<cmath>
#include<queue>
#include<string.h>
using namespace std;

struct change
{
    int num;
    int step;
};

int n,m;
bool vis[10100];
queue<change>q;

bool prime(int x)
{
    if(x<2)
        return false;
    int sqr=(int)sqrt(x*1.0);
    for(int i=2;i<=sqr;i++)
        if(x%i==0)
        return false;
    return true;
}

void bfs()
{
    while(!q.empty())
    {
        change now,next;
        now=q.front();
        q.pop();
        if(now.num==m)
        {
            cout<<now.step<<endl;
            return;
        }
        for(int i=1;i<=9;i+=2)
        {
            int temp=(now.num/10)*10+i;
            if(!vis[temp]&&prime(temp)&&temp!=now.num)
            {
                vis[temp]=1;
                next.num=temp;
                next.step=now.step+1;
                q.push(next);
            }
        }
        for(int i=0;i<=9;i++)
        {
            int temp=now.num/100*100+i*10+now.num%10;
            if(!vis[temp]&&prime(temp)&&temp!=now.num)
            {
                vis[temp]=1;
                next.num=temp;
                next.step=now.step+1;
                q.push(next);
            }
        }
        for(int i=0;i<=9;i++)
        {
            int temp=now.num/1000*1000+i*100+now.num%100;
            if(!vis[temp]&&prime(temp)&&temp!=now.num)
            {
                vis[temp]=1;
                next.num=temp;
                next.step=now.step+1;
                q.push(next);
            }
        }
        for(int i=1;i<=9;i++)
        {
            int temp=i*1000+now.num%1000;
            if(!vis[temp]&&prime(temp)&&temp!=now.num)
            {
                vis[temp]=1;
                next.num=temp;
                next.step=now.step+1;
                q.push(next);
            }
        }
    }
    cout<<"Impossible"<<endl;
    return;
}

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        while(!q.empty())
            q.pop();
        cin>>n>>m;
        memset(vis,0,sizeof(vis));
        vis[n]=1;
        change start;
        start.num=n;
        start.step=0;
        q.push(start);
        bfs();
    }
    return 0;
}
2、Dungeon Master

在立体空间中进行搜索，跟二维空间的搜索相似。

#include<iostream>
#include<queue>
#include<string.h>
using namespace std;

char mp[31][31][31];
int L,R,C;
bool vis[31][31][31];
int dir[6][3]={{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};

struct point
{
    int x,y,z,step;
};

point start,ed;

bool check(int x,int y,int z)
{
    if(x<1||y<1||z<1||x>L||y>R||z>C)
        return true;
    if(mp[x][y][z]=='#')
        return true;
    if(vis[x][y][z])
        return true;
    return false;
}

int bfs()
{
    point now,next;
    queue<point>q;
    q.push(start);
    vis[start.x][start.y][start.z]=1;
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if(now.x==ed.x&&now.y==ed.y&&now.z==ed.z)
            return now.step;
        for(int i=0;i<6;i++)
        {
            next.x=now.x+dir[i][0];
            next.y=now.y+dir[i][1];
            next.z=now.z+dir[i][2];
            if(check(next.x,next.y,next.z))
                continue;
            vis[next.x][next.y][next.z]=true;
            next.step=now.step+1;
            q.push(next);
        }
    }
    return 0;
}

int main()
{
    while(cin>>L>>R>>C)
    {
        if(L+R+C==0)break;
        for(int i=1;i<=L;i++)
            for(int j=1;j<=R;j++)
                for(int k=1;k<=C;k++)
                    cin>>mp[i][j][k];
        for(int i=1;i<=L;i++)
            for(int j=1;j<=R;j++)
                for(int k=1;k<=C;k++)
                {
                    if(mp[i][j][k]=='S')
                    {
                        start.x=i;
                        start.y=j;
                        start.z=k;
                    }
                    if(mp[i][j][k]=='E')
                    {
                        ed.x=i;
                        ed.y=j;
                        ed.z=k;
                    }
                }
        memset(vis,0,sizeof(vis));
        int ans;
        ans=bfs();
        if(ans)
            cout<<"Escaped in "<<ans<<" minute(s)."<<endl;
        else
            cout<<"Trapped!"<<endl;
    }
    return 0;
}