CodeForces 543B Destroying Roads（最短路 + 枚举）

最新推荐文章于 2024-05-26 20:03:32 发布

Tongqi_Liu

最新推荐文章于 2024-05-26 20:03:32 发布

阅读量628

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM/ICPC 图论

本文链接：https://blog.csdn.net/fipped/article/details/46336409

ACM/ICPC 同时被 2 个专栏收录

198 篇文章

订阅专栏

图论

93 篇文章

订阅专栏

本文介绍了一个CodeForces上的题目543B的解题思路及实现过程。该题旨在通过破坏尽量多的道路，确保两个指定点间的距离不超过预设值。文章详细解释了如何使用广度优先搜索算法来求解每一对点之间的最短路径，并通过枚举方法找到最优解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题意：给出n个点，m条边权为1的无向边，破坏尽量多的道路，使得s1到t1的距离不超过d1，s2到t2的距离不超过d2

思路：先对所有点为起点跑bfs，求出s1到t1，s2到t2的最短路，如果dis(s1, t1) > d1 || dis(s2, t2) > d2，那就是不可能的情况，否则枚举任意两点i, j的重叠区间，找出最小的ans，m - ans即是结果

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

const int maxn = 3010;

vector <int> g[maxn];

int vis[maxn], dis[maxn][maxn];

void bfs(int s)
{
    memset(vis, 0, sizeof(vis));
    queue <int> que;
    que.push(s);
    vis[s] = 1;
    while (!que.empty())
    {
        int u = que.front();
        que.pop();
        for (int i = 0; i < g[u].size(); i++)
        {
            int v = g[u][i];
            if (vis[v]) continue;
            vis[v] = 1;
            dis[s][v] = dis[s][u] + 1;
            que.push(v);
        }
    }
}

int main()
{
    int n, m;
    while (~scanf("%d%d", &n, &m))
    {
        for (int i = 0; i <= n; i++)
            g[i].clear();

        for (int i = 0; i < m; i++)
        {
            int u, v;
            scanf("%d%d", &u, &v);
            g[u].push_back(v);
            g[v].push_back(u);
        }

        int s1, t1, d1, s2, t2, d2;
        scanf("%d%d%d%d%d%d", &s1, &t1, &d1, &s2, &t2, &d2);

        for (int i = 1; i <= n; i++)
            bfs(i);

        if (dis[s1][t1] > d1 || dis[s2][t2] > d2)
        {
            puts("-1");
            continue;
        }

        int ans = dis[s1][t1] + dis[s2][t2];
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
            {
                if (dis[s1][i] + dis[i][j] + dis[j][t1] <= d1 && dis[s2][i] + dis[i][j] + dis[j][t2] <= d2)
                    ans = min(ans, dis[s1][i] + dis[i][j] + dis[j][t1] + dis[s2][i] + dis[j][t2]);
                if (dis[s1][i] + dis[i][j] + dis[j][t1] <= d1 && dis[t2][i] + dis[i][j] + dis[j][s2] <= d2)
                    ans = min(ans, dis[s1][i] + dis[i][j] + dis[j][t1] + dis[t2][i] + dis[j][s2]);
                if (dis[t1][i] + dis[i][j] + dis[j][s1] <= d1 && dis[s2][i] + dis[i][j] + dis[j][t2] <= d2)
                    ans = min(ans, dis[t1][i] + dis[i][j] + dis[j][s1] + dis[s2][i] + dis[j][t2]);
                if (dis[t1][i] + dis[i][j] + dis[j][s1] <= d1 && dis[t2][i] + dis[i][j] + dis[j][s2] <= d2)
                    ans = min(ans, dis[t1][i] + dis[j][s1] + dis[t2][i] + dis[i][j] + dis[j][s2]);
            }
        cout << m - ans << endl;
    }
    return 0;
}