codeforces 543 B --Destory Roads （最短路+贪心）

题目：http://codeforces.com/problemset/problem/543/B

题意：若干条无向路，长度皆为1，求满足dist[s1][t1] <= l1 && dist[s2][t2] <= l2 条件下能删除的最多的路径。

思路：bfs O(n^2)跑出多源最短路径，此时要求的是两者路径的最大重合且不超过l1, l2的长度len，贪心暴力即可。

代码：

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int maxn = 3e3+5;
const int inf = 0x3f3f3f3f;

vector<int>vec[maxn];
int n, m, vis[maxn], dist[maxn][maxn];
void bfs(int now){
    queue<P>que; memset(vis, 0, sizeof vis); int start = now;
    que.push(P(now, 0)); vis[now] = 1;
    while(que.size()){
        P now = que.front(); que.pop();
        dist[start][now.first] = now.second;
        for(auto v : vec[now.first]){
            if(vis[v]) continue;
            vis[v] = 1;
            que.push(P(v, now.second+1));
        }
    }
}
int main()
{
    memset(dist, inf, sizeof dist); cin >> n >> m;
    int x, y, s1, t1, l1, s2, t2, l2;
    for(int i=1; i<=m; i++)
        cin >> x >> y, vec[x].push_back(y), vec[y].push_back(x);
    cin >> s1 >> t1 >> l1 >> s2 >> t2 >> l2;
    for(int i=1; i<=n; i++) bfs(i);
    if(dist[s1][t1] > l1 || dist[s2][t2] > l2) {puts("-1"); return 0;}

    int res = dist[s1][t1] + dist[s2][t2];
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            int w1 = min(dist[s1][i]+dist[i][j]+dist[j][t1], dist[s1][j]+dist[j][i]+dist[i][t1]);
            int w2 = min(dist[s2][i]+dist[i][j]+dist[j][t2], dist[s2][j]+dist[j][i]+dist[i][t2]);
            if(w1 > l1 || w2 > l2) continue;
            res = min(res, w1+w2-dist[i][j]);
        }
    }
    cout << m - res << endl;
}