题目描述
题解
先用dfs将每一个island编号。
spfa求出island两两之间最短路。
状压dp搞一搞。第一维是状态,第二维是最后一个到达的island。我是用队列写的。
真的是无故RE啊。Windows+Cena都过了。。。【参考下思路,不要直接对着代码写吧= =】
代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
const int max_n=55;
const int sz=15;
const int INF=2e9;
int sx[4]={0,0,1,-1};
int sy[4]={1,-1,0,0};
int r,c,num;
char s[max_n];
char a[max_n][max_n];
int land[max_n][max_n];
bool vis[max_n][max_n];
int dist[sz+5][sz+5],dis[max_n][max_n];
struct hp{
int x,y;
};
struct hq{
int has_been,island;
};
hp st[sz+5][max_n];
queue <hp> q;
queue <hq> p;
int tot[sz+5];
int f[400000][sz+5];
int goal,ans;
bool atp[400000][sz+5];
inline void dfsland(int x,int y,int num){
land[x][y]=num;
st[num][++tot[num]].x=x,st[num][tot[num]].y=y;
for (int i=0;i<4;++i){
int nowx=x+sx[i],nowy=y+sy[i];
if (nowx>0&&nowx<=r&&nowy>0&&nowy<=c&&a[nowx][nowy]=='X'&&!land[nowx][nowy])
dfsland(nowx,nowy,num);
}
}
inline void spfa(int island){
memset(vis,0,sizeof(vis));
memset(dis,0x7f,sizeof(dis));
while (!q.empty()) q.pop();
for (int i=1;i<=tot[island];++i){
vis[st[island][i].x][st[island][i].y]=true;
dis[st[island][i].x][st[island][i].y]=0;
q.push((hp){st[island][i].x,st[island][i].y});
}
while (!q.empty()){
hp now=q.front(); q.pop();
vis[now.x][now.y]=false;
hp next;
for (int i=0;i<4;++i){
next.x=now.x+sx[i]; next.y=now.y+sy[i];
if (next.x>0&&next.x<=r&&next.y>0&&next.y<=c&&a[next.x][next.y]!='.')
if (a[next.x][next.y]=='S'){
if (dis[next.x][next.y]>dis[now.x][now.y]+1){
dis[next.x][next.y]=dis[now.x][now.y]+1;
if (!vis[next.x][next.y]){
vis[next.x][next.y]=true;
q.push((hp){next.x,next.y});
}
}
}
else{
if (dis[next.x][next.y]>dis[now.x][now.y]){
dis[next.x][next.y]=dis[now.x][now.y];
if (!vis[next.x][next.y]){
vis[next.x][next.y]=true;
q.push((hp){next.x,next.y});
}
}
dist[island][land[next.x][next.y]]=min(dist[island][land[next.x][next.y]],dis[next.x][next.y]);
}
else continue;
}
}
}
int main(){
scanf("%d%d\n",&r,&c);
for (int i=1;i<=r;++i){
gets(s);
for (int j=1;j<=c;++j)
a[i][j]=s[j-1];
}
num=0;
for (int i=1;i<=r;++i)
for (int j=1;j<=c;++j){
if (a[i][j]=='X'&&!land[i][j])
dfsland(i,j,++num);
}
memset(dist,0x7f,sizeof(dis));
for (int i=1;i<=num;++i)
spfa(i);
memset(f,0x7f,sizeof(f));
while (!p.empty()) p.pop();
for (int i=0;i<num;++i){
p.push((hq){1<<i,i+1});
atp[1<<i][i+1]=true;
f[1<<i][i+1]=0;
}
while (!p.empty()){
hq now=p.front(); p.pop();
atp[now.has_been][now.island]=false;
for (int i=0;i<num;++i)
if (f[now.has_been|(1<<i)][i+1]>f[now.has_been][now.island]+dist[now.island][i+1]){
f[now.has_been|(1<<i)][i+1]=f[now.has_been][now.island]+dist[now.island][i+1];
if (!atp[now.has_been+(1<<i)][i+1])
p.push((hq){now.has_been+(1<<i),i+1});
}
}
for (int i=0;i<num;++i)
goal+=(1<<i);
ans=INF;
for (int i=1;i<=num;++i)
ans=min(ans,f[goal][i]);
printf("%d\n",ans);
}
总结
向这种状态很少的情况要考虑状压dp。
以后要有状压dp的意识了,之前都不怎么会。