HDU 2586 How far way?

最新推荐文章于 2024-08-26 15:30:00 发布

转载最新推荐文章于 2024-08-26 15:30:00 发布 · 97 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Mrzdtz220/p/10777239.html

本文深入探讨了图论中的最短路径算法，详细介绍了如何通过构建图的数据结构并运用DFS深度优先搜索算法来寻找两点间的最短路径。文章通过具体的代码实现，展示了算法的运行过程，并解释了关键步骤，如边的添加、节点遍历和路径计算等。

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

传送门

继续水板子题...

#include <bits/stdc++.h>
using namespace std;

inline int read() {
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
    return x * f;
}

const int maxn = 5e5 + 10;

struct Edge { int to, next, c; } edge[2 * maxn];
int cnt, head[maxn];
struct Qedge { int to, next; } qedge[2 * maxn];
int qcnt, qhead[maxn], n, m;
int lca[maxn], dep[maxn], par[maxn];
bool vis[maxn];
inline void addedge(int u, int v, int c) {
    edge[++cnt].to = v;
    edge[cnt].c = c;
    edge[cnt].next = head[u];
    head[u] = cnt; 
}
inline void addqedge(int u, int v) {
    qedge[++qcnt].to = v;
    qedge[qcnt].next = qhead[u];
    qhead[u] = qcnt;
}
int getfa(int x) { return x == par[x] ? x : par[x] = getfa(par[x]); }

void dfs(int u) {
    par[u] = u;
    vis[u] = 1; 
    for (int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].to;
        if (!vis[v]) {
            dep[v] = dep[u] + edge[i].c;
            dfs(v);
            par[v] = u;
        } 
    }
    for (int i = qhead[u]; i; i = qedge[i].next) {
        int v = qedge[i].to;
        if (vis[v]) {
            lca[i] = getfa(v);
            if (i % 2) lca[i + 1] = lca[i];
            else lca[i-1] = lca[i];
        }
    }
}

int main() {
    int T = read();
    while (T--) {
        n = read();m = read();
        memset(head, 0, sizeof(head));
        memset(qhead, 0, sizeof(qhead));
        memset(vis, 0, sizeof(vis));
        memset(lca, 0, sizeof(lca));
        memset(dep, 0, sizeof(dep));
        cnt = qcnt = 0;
        for (int i = 0; i < n - 1; i++)
        {
            int u = read(), v = read(), c = read();
            addedge(u, v, c);
            addedge(v, u, c);
        }
        for (int i = 0; i < m; i++)
        {
            int u = read(), v = read();
            addqedge(u, v);
            addqedge(v, u);
        }
        dfs(1);
        for (int i = 1; i <= m; i++)
        {
            int ans = dep[qedge[2 * i].to] - 2 * dep[lca[2 * i]] + dep[qedge[2 * i - 1].to];
            printf("%d\n", ans);
        }
    }
    return 0;
}

View Code

转载于:https://www.cnblogs.com/Mrzdtz220/p/10777239.html