错误代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
#define pii pair<int,int>
using namespace std;
int n,m,T;
int a[33][33],b[33][33],num[33][33];
int dis[1010],sx[1010],sy[1010],tot;
int cnt,c[1010];
int s;
double ans;
priority_queue< pii,vector<pii>,greater<pii> > q;
int read(){
char ch=getchar();
while(ch != '0' && ch != '1') ch=getchar();
return ch-'0';
}
void dij(int X,int sum){
q.push(make_pair((a[sx[X]][sy[X]] == 1),X));
while(!q.empty()){
pii tt=q.top(); q.pop();
int u=tt.second;
int x=sx[u],y=sy[u],d=tt.first;
if(d > T) continue;
dis[u]=min(dis[u],d);
if(b[x][y] == sum) continue;
b[x][y]=sum; c[++cnt]=u;
if(d+(a[x+1][y] == 1) < dis[u+m] && x < n) q.push(make_pair(d+(a[x+1][y] == 1),u+m));
if(d+(a[x-1][y] == 1) < dis[u-m] && x > 1) q.push(make_pair(d+(a[x-1][y] == 1),u-m));
if(d+(a[x][y+1] == 1) < dis[u+1] && y < m) q.push(make_pair(d+(a[x][y+1] == 1),u+1));
if(d+(a[x][y-1] == 1) < dis[u-1] && y > 1) q.push(make_pair(d+(a[x][y-1] == 1),u-1));
}
}
- 上面这段四个方向写的非常麻烦,可以提前用数组存储
- 矩阵中每个位置的编号可以用函数来计算,而不是开一堆数组彼此映射
void work(){
for(int i=1; i<=cnt; i++)
for(int j=1; j<=i; j++){
if(i == j) continue;
int x1=sx[c[i]],y1=sy[c[i]],x2=sx[c[j]],y2=sy[c[j]];
double anst=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
ans=max(ans,anst);
}
cnt=0;
memset(dis,127,sizeof(dis));
}
企图减少运算过程,但是数组的标记并不合理,前面的标记值并不可在后续沿用
计算好复杂度,直接每个点都扫一遍就好
int main(){
freopen("4162.in","r",stdin);
// freopen("4162.out","w",stdout);
cin>>n>>m>>T;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++){
tot++;
a[i][j]=read();
sx[tot]=i;
sy[tot]=j;
dis[tot]=1000;
num[i][j]=tot;
}
for(int i=1; i<=n; i++) b[i][0]=b[i][m+1]=1;
for(int i=1; i<=m; i++) b[0][i]=b[0][n+1]=1;
dij(1,++s);
work();
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
if(!b[i][j]){
dij(num[i][j],++s);
work();
}
printf("%6f",sqrt(ans));
}
std
#include<bits/stdc++.h>
using namespace std;
int n,m,t;
char s[40][40];
int ne[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
double d[1010][1010],maxx;
int dist[1010];
int start[1010];
bool book[1010];
struct node
{
int to,next,w;
}edge[1234567];
int head[1010],k;
void adde(int u,int v,int w) { edge[++k].to=v; edge[k].w=w; edge[k].next=head[u]; head[u]=k; }
int id(int x,int y) { return n*(x-1)+y; }//得到这个点的编号
void spfa(int s)
{
queue<int> q;
for(int i=1;i<=n*m;i++) dist[i]=99999999,book[i]=0;
dist[s]=start[s]; book[s]=1; q.push(s);
while(!q.empty())
{
int u=q.front(); q.pop(); book[u]=0;
maxx=max(maxx,d[s][u]);
for(int i=head[u];i;i=edge[i].next)
{
int v=edge[i].to;
if(dist[v]>dist[u]+edge[i].w)
{
dist[v]=dist[u]+edge[i].w;
if(!book[v]&&dist[v]<=t) q.push(v),book[v]=1;
}
}
}
}
int main()
{
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=n;i++) scanf("%s",s[i]+1);
for(int i=1;i<=n;i++)//预处理两点之间的欧几里得距离
for(int j=1;j<=m;j++)
for(int k=1;k<=n;k++)
for(int l=1;l<=m;l++)
d[id(i,j)][id(k,l)]=sqrt((i-k)*(i-k)+(j-l)*(j-l));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(s[i][j]=='1') start[id(i,j)]=1;
for(int k=0;k<4;k++)
{
int tx=i+ne[k][0],ty=j+ne[k][1];
if(tx<1||ty<1||tx>n||ty>m) continue;
int w=s[tx][ty]-'0';
adde(id(i,j),id(tx,ty),w);
}
}
}
for(int i=1;i<=n*m;i++) spfa(i);
printf("%.6f",maxx);
return 0;
}
直接用带剪枝的记忆化搜索,全部扫一遍也ok。qwq