Lennot

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:75:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < cityList[cities - 1].flightsIn.size(); i++){
                    ^
input/code.cpp:94:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int j = 0; j < cityList[pos].plans.size(); j++){
                        ^
input/code.cpp:118:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < cityList[0].plans.size();i++){
                    ^

// DT4.cpp : Defines the entry point for the console application.
//

#include <iostream>
#include <stdio.h>
#include <vector>
#include <deque>

using namespace std;

struct flight {
	int from;
	int to;
	int price;
};
struct flightPlan {
	//struct flight f;
	int flightsLeft;
	int unevenCost;
	int evenCost;
	vector<int> visited;
};
struct city {
	vector<flight> flightsFrom;
	vector<flight> flightsIn;
	vector<flightPlan> plans;
};
typedef struct flight flight;
typedef struct city city;
typedef struct flightPlan flightPlan;

/*int haku(city *cityList,int pos,int cities,int price,int count){
	if (pos == cities-1)
		return price;
	cityList[pos].isVisited = 1;
	int bestPrice = -1;
	for (int i = 0; i < cityList[pos].flightsFrom.size(); i++){
		if (cityList[cityList[pos].flightsFrom[i].to].isVisited==0){
			int newPos = cityList[pos].flightsFrom[i].to;
			int newPrice = price;
			if (count % 2 != 0)
				newPrice += cityList[pos].flightsFrom[i].price;
			//cout << "taking flight from " << pos << " to " << newPos << endl;
			int ret = haku(cityList, newPos, cities, newPrice, count + 1);
			//cout << "ret from: " << ret << "  ( from " << pos << " to " << newPos << ")" << endl;
			if ((ret != -1) && (ret < bestPrice || bestPrice == -1))
				bestPrice = ret;
		}
	}
	cityList[pos].isVisited = 0;
	return bestPrice;
}*/

int main(int argc, char* argv[])
{
	ios_base::sync_with_stdio(0);
	int cities, flights;
	cin >> cities >> flights;
	city *cityList = new city[cities];

	for (int i = 0; i < flights; i++){
		flight f;
		cin >> f.from >> f.to >> f.price;
		f.from--;
		f.to--;
		cityList[f.from].flightsFrom.push_back(f);
		//cityList[i].isVisited = 0;
		cityList[f.to].flightsIn.push_back(f);
		//cout << "from: " << f.from << " to: " << f.to << " price: " << f.price << endl;
	}
	//vector<flightPlan> plans;
	deque<int> locations;
	vector<int> visited(cities,0);
	int index = 1;
	for (int i = 0; i < cityList[cities - 1].flightsIn.size(); i++){
		flightPlan fp;
		fp.flightsLeft = 1;
		fp.unevenCost = cityList[cities - 1].flightsIn[i].price;
		fp.evenCost = 0;
		fp.visited = visited;
		cityList[cityList[cities - 1].flightsIn[i].from].plans.push_back(fp);
		locations.push_back(cityList[cities - 1].flightsIn[i].from);
	}
	index++;
	while (!locations.empty()){
		int toHandle = locations.size();
		int handled = 0;
		while (handled<toHandle){
			int pos = locations.front();
			locations.pop_front();
			int size = cityList[pos].flightsIn.size();
			//plans.resize(plans.size() + size, fp);
			for (int i = 0; i < size; i++){
					for (int j = 0; j < cityList[pos].plans.size(); j++){
						flightPlan fp;
						fp.flightsLeft = index;
						fp.evenCost = cityList[pos].plans[j].evenCost;
						fp.unevenCost = cityList[pos].plans[j].unevenCost;
						fp.visited = cityList[pos].plans[j].visited;
						fp.visited[pos] = 1;
						if (index % 2 == 0)
							fp.evenCost += cityList[pos].flightsIn[i].price;
						else
							fp.unevenCost += cityList[pos].flightsIn[i].price;
						cityList[cityList[pos].flightsIn[i].from].plans.push_back(fp);
						if (cityList[pos].plans[j].visited[cityList[pos].flightsIn[i].from] == 0 && cityList[pos].flightsIn[i].from != 0){
							locations.push_back(cityList[pos].flightsIn[i].from);
						}
					}
				
			}
			handled++;
		}
		index++;
	}
	//cout << "print all flight options: " << endl;
	int cheapest = -1;
	for (int i = 0; i < cityList[0].plans.size();i++){
		int cost;
		if (cityList[0].plans[i].flightsLeft % 2 == 0)
			cost = cityList[0].plans[i].evenCost;
		else
			cost = cityList[0].plans[i].unevenCost;
		if (cheapest == -1 || cost < cheapest)
			cheapest = cost;
		//cout << i << ": flightsNeeded: " << cityList[0].plans[i].flightsLeft << " unevenCost: " << cityList[0].plans[i].unevenCost << " Evencost: " << cityList[0].plans[i].evenCost << endl;
	}
	cout << cheapest;
	//cout << haku(cityList, 0, cities, 0, 1);
	delete[] cityList;
	return 0;
}

Test 1

Group: 1

Verdict: RUNTIME ERROR

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: RUNTIME ERROR

Test 4

Group: 1

Verdict: RUNTIME ERROR

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 2

Verdict: RUNTIME ERROR

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