AcWing350.巡逻

刷题之路-图论

AcWing350.巡逻

传送门

做题思路及代码

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int N = 100005;
struct edge
{
    int v, next, w;
}e[N * 2];
int n, eid, p[N];
void init()
{
    eid = 0;
    memset(p, -1, sizeof p);
}
void insert(int u, int v, int w)
{
    e[eid].v = v;
    e[eid].w = w;
    e[eid].next = p[u];
    p[u] = eid ++;
}

int MAX = 0, point = -1;
bool vst[N];
void dfs(int u, int step)
{
    if(MAX < step)
    {
        MAX = step;
        point = u;
    }
    vst[u] = 1;
    for(int i = p[u]; i + 1; i = e[i].next)
    {
        int v = e[i].v;
        if(vst[v]) continue;
        dfs(v, step + 1);
    }
}

//把最远的两个点之间的路径反向
bool reach = 0;
void dfsPath(int u, int end)
{
    if(u == end) reach = 1;
    if(reach) return;
    vst[u] = 1;
    for(int i = p[u]; i + 1; i = e[i].next)
    {
        int v = e[i].v;
        if(vst[v]) continue;
        e[i].w = -1;
        dfsPath(v, end);
        if(reach) return;
        e[i].w = 1;
    }
}

int dp[N];
//dp[i]指的是离i点最远的点的距离
void getdp(int u, int &res)
{
    vst[u] = 1;
    for(int i = p[u]; i + 1; i = e[i].next)
    {
        int v = e[i].v, w = e[i].w;
        if(vst[v]) continue;
        getdp(v, res);
        res = max(res, dp[u] + dp[v] + w);
        //因为此时dp[u]还没通过dp[v]更新，所以dp[u]存的是不经过v点的最大距离，那么加上dp[v] + w
        //就是距离最远的两个点
        dp[u] = max(dp[u], dp[v] + w);
    }
}

int main()
{
    init();
    int k;
    cin >> n >> k;
    for(int i = 1; i < n; i ++) 
    {
        int u, v;
        cin >> u >> v;
        insert(u, v, 1);
        insert(v, u, 1);
    }
    
    //两遍dfs找最大直径
    dfs(1, 0);
    memset(vst, 0, sizeof vst);
    MAX = 0;
    int start = point;
    dfs(start, 0);

    
    if(k == 1) cout << 2 * (n - 1) - MAX + 1;
    else 
    {
        memset(vst, 0, sizeof vst);
        dfsPath(start, point);
        memset(vst, 0, sizeof vst);
        dfsPath(point, start);
        
        memset(dp, 0, sizeof dp);
        memset(vst, 0, sizeof vst);
        int res = 0;
        getdp(start, res);
        cout << 2 * n - MAX - res;
    }
    
    return 0;
}