力扣 LCP 07. 传递信息 bfs/dfs/dp

https://leetcode-cn.com/problems/chuan-di-xin-xi/

思路一：无脑遍历，dfs/bfs均可，时间复杂度$O(n^k)$。

class Solution {
public:
    int numWays(int n, vector<vector<int>>& relation, int k) {
        vector<vector<int>> vec(n,vector<int>());
        for(vector<int>& rel:relation)
            vec[rel[0]].push_back(rel[1]);
        using pr=pair<int,int>;
        queue<pr> q;
        q.emplace(0,0);
        int ans=0;
        while(!q.empty())
        {
            pr f=q.front();
            q.pop();
            if(f.second<k)
            {
                for(int to:vec[f.first])
                    q.emplace(to,f.second+1);
            }
            else if(f.second==k&&f.first==n-1)
                ++ans;
        }
        return ans;
    }
};

思路二：$d{p}_{i,j}$表示经过$j$次传递后达到点$i$的情况数，初始化$d{p}_{0,0}=1$，有转移方程：
$$d{p}_{j,k}=\sum _{i=0}^{n-1}\sum _j^{(i,j)\in E}d{p}_{j,k-1}$$

时间复杂度可降低至$O(mk)$，其中$m$为边的总数。

class Solution {
public:
    int numWays(int n, vector<vector<int>>& relation, int k) {
        vector<vector<int>> vec(n,vector<int>());
        vector<vector<int>> dp(n,vector<int>(k+1,0));
        for(vector<int>& rel:relation)
            vec[rel[0]].push_back(rel[1]);
        dp[0][0]=1;
        for(int times=1;times<=k;times++)
        {
            for(int i=0;i<n;i++)
            {
                for(int to:vec[i])
                    dp[to][times]+=dp[i][times-1];
            }
        }
        return dp[n-1][k];
    }
};