Lennot

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:25:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0;j< cityList[i].size(); j++){ // loop the outgoing flights from city i
                   ^
input/code.cpp:29:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < cityList[cityList[i][j].first].size(); k++){ // loop the outgoing flight from the next city
                      ^
input/code.cpp:49:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < v[s].size(); i++) {
                     ^
input/code.cpp:12:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &cities, &flights);
                                   ^
input/code.cpp:16:40: warning: ignoring return value of 'int scanf(const char*, ...)'...

#include <stdio.h>
#include <vector>
#include <queue>
 
using namespace std;
 
#define INF 999999999
 
int main(int argc, char* argv[])
{
	int cities, flights;
	scanf("%d %d", &cities, &flights);
	vector<vector<pair<int,int>> > cityList(cities);
	for (int i = 0; i < flights; i++){
		int from,to,price;
		scanf("%d %d %d", &from, &to, &price);
		if (from != cities){
			from--;
			to--;
			cityList[from].push_back(make_pair(to,price));
		}
	}
	vector<vector<pair<int, int>> > v(cities);
	for (int i = 0; i < cities; i++){ // outgoing flights per city
		for (int j = 0;j< cityList[i].size(); j++){ // loop the outgoing flights from city i
			if (cityList[i][j].first == cities - 1){
				v[i].push_back(make_pair(cityList[i][j].first, cityList[i][j].second));
			}
			for (int k = 0; k < cityList[cityList[i][j].first].size(); k++){ // loop the outgoing flight from the next city
				v[i].push_back(make_pair(cityList[cityList[i][j].first][k].first, cityList[i][j].second));
			}
		}
	}
	priority_queue<pair<int, int>> q;
	int t[100001], e[100001];
	for (int i = 1; i < cities; i++){
		e[i] = INF;
		t[i] = 0;
	}
	t[0] = 0;
	e[0] = 0;
	q.push(make_pair(0, 0));
	while (!q.empty()) {
		int x = -q.top().first;
		int s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (int i = 0; i < v[s].size(); i++) {
			int u = v[s][i].first;
			if (x + v[s][i].second < e[u]) {
				e[u] = x + v[s][i].second;
				q.push(make_pair(-e[u], u));
			}
		}
	}
	printf("%d", e[cities - 1]);
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

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: RUNTIME ERROR

Test 16

Group: 3

Verdict: RUNTIME ERROR

Test 17

Group: 3

Verdict: RUNTIME ERROR