Lennot

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:62:32: warning: array subscript has type 'char' [-Wchar-subscripts]
    if ((price[dest].price[c2.id] == NOTSET || price[c.cityID].price[id] + cityList[c.cityID][j].list[id] < price[dest].price[c.id])){
                                ^
input/code.cpp:62:130: warning: array subscript has type 'char' [-Wchar-subscripts]
    if ((price[dest].price[c2.id] == NOTSET || price[c.cityID].price[id] + cityList[c.cityID][j].list[id] < price[dest].price[c.id])){
                                                                                                                                  ^
input/code.cpp:63:28: warning: array subscript has type 'char' [-Wchar-subscripts]
     price[dest].price[c2.id] = price[c.cityID].price[id] + cityList[c.cityID][j].list[id];
                            ^
input/code.cpp:30:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunu...

#include <stdio.h>
#include <vector>
#include <deque>
 
using namespace std;
 
struct city{
	int cityID;
	char id;
};
struct priceStruct{
	long price[3];
};
struct flight{
	int list[3];
};
typedef struct city city;
typedef struct flight flight;
typedef struct priceStruct priceStruct;
 
#define NOTSET -1
#define COST 0
#define FREE 1
#define TO 2
#define SWAP(x) ( (x-1) *-1) 
 
int main(int argc, char* argv[])
{
	int cities, flights;
	scanf("%d %d", &cities, &flights);
	vector<vector<flight> > cityList(cities);
	flight f;
	f.list[FREE] = 0;
	for (int i = 0; i < flights; i++){
		int from;
		scanf("%d %d %d", &from, &f.list[TO], &f.list[COST]);
		if (from != cities && f.list[TO]!=1){
			from--;
			f.list[TO]--;
			cityList[from].push_back(f);
		}
	}
	priceStruct ps;
	ps.price[COST] = -1;
	ps.price[FREE] = -1;
	deque<city> z;
	vector<priceStruct> price(cities, ps);
	price[0].price[COST] = 0;
	price[0].price[FREE] = -1;
	city c;
	c.cityID = 0;
	c.id = COST;
	z.push_back(c);
	while (!z.empty()){
		c = z.front();
		int id = c.id;
		for (unsigned int j = 0; j < cityList[c.cityID].size(); j++) {
			int dest = cityList[c.cityID][j].list[TO];
			city c2;
			c2.cityID = dest;
			c2.id=SWAP(id);
			if ((price[dest].price[c2.id] == NOTSET || price[c.cityID].price[id] + cityList[c.cityID][j].list[id] < price[dest].price[c.id])){
				price[dest].price[c2.id] = price[c.cityID].price[id] + cityList[c.cityID][j].list[id];
				z.push_back(c2);
			}
		}
		z.pop_front();
	}
	if (price[cities - 1].price[COST] != NOTSET){
		if (price[cities - 1].price[FREE] != NOTSET){
			if (price[cities - 1].price[COST] > price[cities - 1].price[FREE])
				printf("%ld", price[cities - 1].price[FREE]);
			else
				printf("%ld", price[cities - 1].price[COST]);
		}
		else
			printf("%ld", price[cities - 1].price[COST]);
	}
	else
		printf("%ld", price[cities - 1].price[FREE]);
	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: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED