sem_2/task_S.cpp at master · AlexMaximenko/sem_2 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>

class Edge
{
public:
	Edge(size_t from, size_t to, int weight)
	{
		from_ = from;
		to_ = to;
		weight_ = weight;
	}
	bool operator <(const Edge& second) const
	{
		return ((weight_ < second.weight_));
	}

	size_t getTo() const
	{
		return to_;
	}
	size_t getFrom() const
	{
		return from_;
	}
	size_t getWeight() const
	{
		return weight_;
	}
private:
	size_t from_, to_;
	int weight_;
};

class Graph
{
public:
	typedef size_t Vertex;
	Graph(size_t vertex_count, bool is_directed = false)
	{
		vertex_count_ = vertex_count;
		is_directed_ = is_directed;
	}

	size_t getVertexCount() const
	{
		return vertex_count_;
	}

	size_t geEdgeCount() const
	{
		return is_directed_ ? edge_count_ : edge_count_;
	};

	virtual std::vector<Vertex> getNeighbors(const Vertex& v) const = 0;

	virtual size_t getNeighborsCount(const Vertex& v) const = 0;

	virtual void addEdge(const Vertex& start, const Vertex& finish, const int weight = 0)
	{
		edge_count_++;
	}
	virtual std::vector<Edge> getEdges() const = 0;

protected:
	bool is_directed_;
	size_t vertex_count_,
		edge_count_;
};


class GraphAdjList : public Graph
{
public:
	GraphAdjList(const size_t vertex_count, bool is_directed) :
		Graph(vertex_count, is_directed)
	{
		adj_list_ = std::vector<std::vector<Vertex>>(vertex_count);
	}

	virtual void addEdge(const Vertex& start, const Vertex& finish, const int weight = 1)
	{
		Graph::addEdge(start, finish);
		adj_list_[start].push_back(finish);
		edges.push_back(Edge(start, finish, weight));
		if (!is_directed_)
		{
			adj_list_[finish].push_back(start);
			edges.push_back(Edge(finish, start, weight));
		}
	}

	std::vector<Vertex> getNeighbors(const Vertex& v) const override
	{
		return adj_list_[v];
	}

	size_t getNeighborsCount(const Vertex&  v) const override
	{
		return adj_list_[v].size();
	}

	std::vector<Edge> getEdges() const override
	{
		return edges;
	}

private:
	std::vector <std::vector<Vertex>> adj_list_;
	std::vector<Edge> edges;
};
namespace GraphProcessing
{
	namespace
	{
		const size_t INF = -1;
		void Relax(const Edge& edge, std::vector<int>& distance)
		{
			if (distance[edge.getTo()] > distance[edge.getFrom()] + edge.getWeight())
			{
				distance[edge.getTo()] = distance[edge.getFrom()] + edge.getWeight();
			}
		}
	}
	std::vector<int> findDistances(const Graph& g, Graph::Vertex source)
	{
		std::vector<int> distance(g.getVertexCount(), INF);
		distance[0] = 0;
		for (size_t i = 0; i < g.getVertexCount() - 1; i++)
		{
			for (Edge edge : g.getEdges())
			{
				if (distance[edge.getFrom()] != -1)
				{
					Relax(edge, distance);
				}
			}
		}
		return distance;
	}

}

int main()
{
	size_t n, m;
	std::cin >> n >> m;
	GraphAdjList g(n, true);
	for (size_t i = 0; i < m; i++)
	{
		size_t from, to;
		int weight;
		std::cin >> from >> to >> weight;
		g.addEdge(from - 1, to - 1, weight);
	}
	for (int i : GraphProcessing::findDistances(g, 0))
	{
		std::cout << ((i != -1) ? i : 30000) << " ";
	}
	return 0;
}