leetcode 日志 743

最新推荐文章于 2024-08-11 19:58:59 发布

iywwuyifan

最新推荐文章于 2024-08-11 19:58:59 发布

阅读量448

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/MasterchiefCC/article/details/80593612

版权

leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

蛮蠢的... 把Dijkstra算法写成了minimum spanning tree，我佛了...

debug了一小时...

我佛了

两个代码都贴下...上面那个是错的...

class Solution {
public:
	int networkDelayTime(vector<vector<int>>& times, int N, int K) {
		vector<map<int, int>>m_map(N + 1);
		for (const vector<int>& time : times) {
			const int& source = time[0];
			const int& target = time[1];
			const int& dis = time[2];
			m_map[source][target] = dis;
		}

		vector<bool>used(N + 1, false);
		vector<int>time(N + 1, 0);

		auto cmp = [](const edges& lhs, const edges& rhs) {return lhs.dist>rhs.dist; };
		priority_queue<pair<int, int>, vector<edges>, decltype(cmp)>m_pq(cmp);

		for (auto it : m_map[K])m_pq.push(edges(K, it.first, it.second));
		used[K] = true;

		while (!m_pq.empty()) {
			int source = m_pq.top().source;
			int target = m_pq.top().target;
			int dist = m_pq.top().dist;
			m_pq.pop();

			if (used[target])continue;
			time[source] = max(time[source], dist);
			for (auto it : m_map[target]){
                if(!used[it.first]){
                    m_pq.push(edges(target, it.first, it.second));
                }
            }
			used[target] = true;
		}

		int ret = 0;
		for (int i = 1; i<used.size(); ++i) {
			if (used[i] == false)return -1;
			ret += time[i];
		}

		return ret;
	}
private:
	struct edges {
		int source, target, dist;
		edges(const int& source, const int& target, const int& dist) :source(source), target(target), dist(dist) {}
	};
};

class Solution {
public:
    int networkDelayTime(vector<vector<int>>& times, int N, int K) {
        vector<map<int, int>>m_map(N+1);
        for(const vector<int>& time: times){
            const int& source=time[0];
            const int& target=time[1];
            const int& dis=time[2];
            m_map[source][target]=dis;
        }
        
        vector<int>buffer(N+1, INT_MAX);
        
        auto cmp=[](const edges& lhs, const edges& rhs){return lhs.dist>rhs.dist;};
        priority_queue<pair<int, int>, vector<edges>, decltype(cmp)>m_pq(cmp);
        
        m_pq.push(edges(K, 0));
        
        while(!m_pq.empty()){
            int target=m_pq.top().target;
            int dist=m_pq.top().dist;
            m_pq.pop();
            if(dist>=buffer[target])continue;
            buffer[target]=dist;
            for(auto it:m_map[target]){
                int temp_dist=dist+it.second;
                if(temp_dist<buffer[it.first])m_pq.push(edges(it.first, temp_dist));
            }
            
        }
        int ret=INT_MIN;
        for(int i=1; i<buffer.size(); ++i){
            if(buffer[i]==INT_MAX)return -1;
            ret=max(ret, buffer[i]);
        }
        
        return ret;
        
    }
private:
    struct edges{
        int target, dist;
        edges(const int& target, const int& dist):target(target), dist(dist){}
    };
};