题意:
给一个n*m地图,有的格子有障碍。只能上下左右走。假如两个格子能够互相到达,那么他们的距离为它们的欧几里得距离。
问你拿掉最多k个障碍,最大的两点间距离时多少。n,m<=30
做法:
发现n和m很小。
于是我们考虑暴力枚举一个点,从这个点spfa求出到所有点的最少要拿掉的障碍数,然后暴力判断每个点是否满足要求,满足即可更新答案。
代码:
/*************************************************************
Problem: bzoj 1295 [SCOI2009]最长距离
User: fengyuan
Language: C++
Result: Accepted
Time: 892 ms
Memory: 1312 kb
Submit_Time: 2018-01-05 14:47:07
*************************************************************/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#define x first
#define y second
#define sqr(x) ((x)*(x))
#define PII pair<int, int>
#define mp make_pair
using namespace std;
const int N = 35;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
int n, m, K;
char a[N][N];
int dis[N][N];
bool vis[N][N];
inline bool ok(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m; }
inline bool spfa(PII s)
{
queue<PII> q; q.push(s);
memset(dis, 0x3f, sizeof dis); dis[s.x][s.y] = a[s.x][s.y]-'0';
memset(vis, 0, sizeof vis); vis[s.x][s.y] = 1;
while(!q.empty()) {
PII u = q.front(); q.pop(); vis[u.x][u.y] = 0;
for(int i = 0; i < 4; i ++) {
PII v; v.x = u.x+dx[i]; v.y = u.y+dy[i];
if(!ok(v.x, v.y)) continue;
if(dis[v.x][v.y] > dis[u.x][u.y]+a[v.x][v.y]-'0') {
dis[v.x][v.y] = dis[u.x][u.y]+a[v.x][v.y]-'0';
if(!vis[v.x][v.y]) {
vis[v.x][v.y] = 1;
q.push(v);
}
}
}
}
}
inline double getdis(int x1, int y1, int x2, int y2) { return sqrt(sqr(x1-x2)+sqr(y1-y2)); }
int main()
{
scanf("%d%d%d", &n, &m, &K);
for(int i = 1; i <= n; i ++) scanf("%s", a[i]+1);
double ans = 0;
for(int x1 = 1; x1 <= n; x1 ++)
for(int y1 = 1; y1 <= m; y1 ++) {
spfa(mp(x1, y1));
for(int x2 = 1; x2 <= n; x2 ++)
for(int y2 = 1; y2 <= m; y2 ++)
if(dis[x2][y2] <= K) ans = max(ans, getdis(x1, y1, x2, y2));
}
printf("%.6lf\n", ans);
return 0;
}