Lennot

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:70:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < z.size(); i++) {
                    ^
input/code.cpp:71:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < cityList[z[i]].size(); j++) { 
                     ^

// 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;
	vector<vector<pair<int, int> > > cityList(cities);

	for (int i = 0; i < flights; i++){
		int from,to,price;
		cin >> from >> to >> price;
		from--;
		to--;
		cityList[from].push_back(make_pair(to, price));
	}
	vector<int> z, isAdded(cities), distance(cities,-1);
	z.push_back(0);
	for (int i = 0; i < z.size(); i++) {
		for (int j = 0; j < cityList[z[i]].size(); j++) { 
			int u = cityList[z[i]][j].first; 
			if (isAdded[u]) continue;
			isAdded[u] = 1; 
			if ((i + 1) % 2 != 0){
				if (distance[u] == -1 || distance[u]>distance[z[i]] + cityList[z[i]][j].second)
					distance[u] = distance[z[i]] + cityList[z[i]][j].second;
			}
			else
				if (distance[u] == -1 || distance[u]>distance[z[i]])
					distance[u] = distance[z[i]];
			z.push_back(u);
		}
	}
	cout << distance[cities - 1];
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 3

Verdict: WRONG ANSWER