Lennot

#include <iostream>
#include <vector>
#include <string>
#include <list>
 
#include <limits> // for numeric_limits
 
#include <set>
#include <utility> // for pair
#include <algorithm>
#include <iterator>
using namespace std;
class Flight
{
public:
	Flight(unsigned int from, unsigned int to, unsigned int price);
	unsigned int from, to, price;
};
Flight::Flight(unsigned int from, unsigned int to, unsigned int price){
	this->from = from; this->to = to; this->price = price;
}
// Number of vertices in the graph
 
 
typedef int vertex_t;
typedef double weight_t;
 
const weight_t max_weight = std::numeric_limits<double>::infinity();
 
struct neighbor {
	vertex_t target;
	weight_t weight;
	neighbor(vertex_t arg_target, weight_t arg_weight)
		: target(arg_target), weight(arg_weight) { }
};
 
typedef std::vector<std::vector<neighbor> > adjacency_list_t;
 
 
void DijkstraComputePaths(vertex_t source,
	const adjacency_list_t &adjacency_list,
	std::vector<weight_t> &min_distance,
	std::vector<vertex_t> &previous)
{
	int n = adjacency_list.size();
	min_distance.clear();
	min_distance.resize(n, max_weight);
	min_distance[source] = 0;
	previous.clear();
	previous.resize(n, -1);
	std::set<std::pair<weight_t, vertex_t> > vertex_queue;
	vertex_queue.insert(std::make_pair(min_distance[source], source));
	//bool free = true;
	while (!vertex_queue.empty())
	{
		//free = !free;
		weight_t dist = vertex_queue.begin()->first;
		vertex_t u = vertex_queue.begin()->second;
		vertex_queue.erase(vertex_queue.begin());
 
		// Visit each edge exiting u
		const std::vector<neighbor> &neighbors = adjacency_list[u];
		for (std::vector<neighbor>::const_iterator neighbor_iter = neighbors.begin();
			neighbor_iter != neighbors.end();
			neighbor_iter++)
		{
			vertex_t v = neighbor_iter->target;
			weight_t weight = neighbor_iter->weight;
			//Each other flight free -> dist = 0
			/*if (free){
				weight = 0;
			}*/
			weight_t distance_through_u = dist + weight;
			if (distance_through_u < min_distance[v]) {
				vertex_queue.erase(std::make_pair(min_distance[v], v));
				
				min_distance[v] = distance_through_u;
				
				
				previous[v] = u;
				vertex_queue.insert(std::make_pair(min_distance[v], v));
 
			}
 
		}
	}
}
 
 
std::list<vertex_t> DijkstraGetShortestPathTo(
	vertex_t vertex, const std::vector<vertex_t> &previous)
{
	std::list<vertex_t> path;
	for (; vertex != -1; vertex = previous[vertex])
		path.push_front(vertex);
	return path;
}
/*unsigned int** createMatrix(std::vector <Flight> flights){
//unsigned int* matrix = new unsigned int[3];
//unsigned int** matrix2 = new unsigned int*[flights.size()];
//matrix2
}*/
adjacency_list_t createGraph(vector<Flight> flights, unsigned int n){
	unsigned int v = n;//flights.size();
	vector<vector<unsigned int>> graph;
	for (unsigned int i = 0; i < v; i++){
		//unsigned int* p = new unsigned int[v];
		graph.push_back(vector<unsigned int>());
		for (unsigned int z = 0; z < v; z++){
			graph.back().push_back(0);
		}
	}
	adjacency_list_t adjList(n);
	//Arrange flights by "from"
	//For all flights with start point of 1 check the price to dest
	for (Flight f : flights){
		adjList[f.from - 1].push_back(neighbor(f.to - 1, f.price));// [f.to - 1] = f.price;
	}
	return adjList;
}
// Driver program to test methods of graph class
int main()
{
	/* Let us create the example graph discussed above */
	//Price as a distance
 
	unsigned int n = 0;
	unsigned int m = 0;
	cin >> n;
	cin >> m;
	//V = n;
	vector<Flight> flights;
	for (unsigned int i = 0; i < m; i++){
		unsigned int from, to, price;
		cin >> from >> to >> price;
		flights.push_back(Flight(from, to, price));
	}
	//cin >> V;
	//vector<Flight> flights;
	//flights.push_back(Flight(1, n, 100));
	//flights.push_back(Flight(1, 2, 10));
	//flights.push_back(Flight(2, n, 10));
	adjacency_list_t adjacency_list = createGraph(flights, n);
	//graph[0][1] = 3;
	//graph[0][2] = 5;
	//graph[1][0] = 2;
	//{ 0, 0, 0, 9, 0, 10, 0, 0, 0 },
	//{ 0, 0, 4, 0, 10, 0, 2, 0, 0 },
	//{ 0, 0, 0, 14, 0, 2, 0, 1, 6 },
	//{ 8, 11, 0, 0, 0, 0, 1, 0, 7 },
	//{ 0, 0, 2, 0, 0, 0, 6, 7, 0 }
	std::vector<weight_t> min_distance;
	std::vector<vertex_t> previous;
	DijkstraComputePaths(0, adjacency_list, min_distance, previous);
	//unsigned int price = min_distance[n - 1];
	std::list<vertex_t> path = DijkstraGetShortestPathTo(n - 1, previous);
	unsigned long price = 0;
	//bool free = true;
	while(path.size() != 0){
		//std::cout << path.front() + 1 << ' ';
		unsigned int flightStartPlace = path.front() + 1;
		path.pop_front();
		unsigned int flightEndPlace = path.front() + 1;
		for (Flight f : flights){
			if (f.from == flightStartPlace && f.to == flightEndPlace){
				//free = !free;
				//if (free){ break; }
				price += f.price;
				break;
			}
		}
		//price += flights.at(index).price;
		//path.pop_front();
		if (path.size() == 0){ break; }
		path.pop_front();
	}
	//std::copy(path.begin(), path.end(), std::ostream_iterator<vertex_t>(std::cout, " "));
	std::cout << price << std::endl;
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 3

Verdict: RUNTIME ERROR

Test 17

Group: 3

Verdict: RUNTIME ERROR