Lennot

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:32:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (unsigned int j = 1; j < cityList[i][0].first; j++){
                              ^
input/code.cpp:39:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (unsigned int k = 1; k < cityList[dest][0].first; k++){
                                ^
input/code.cpp:64:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < v[s].size(); i++) {
                     ^
input/code.cpp:13: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:22:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-res...

#include <stdio.h>
#include <vector>
#include <queue>

using namespace std;

#define ll long long
const long long INF = 10000000000000000L;

int main(int argc, char* argv[])
{
	int cities, flights;
	scanf("%d %d", &cities, &flights);
	pair<int, int> **cityList = new pair<int, int>*[cities];
	for (int i = 0; i < cities; ++i){
		cityList[i] = new pair<int, int>[200002];
		cityList[i][0] = make_pair(1,0);
	}

	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][cityList[from][0].first] = make_pair(to, price);
			cityList[from][0].first = cityList[from][0].first+1;
		}
	}
	vector<vector<pair<int, int> > > v(cities);
	for (int i = 0; i < cities; i++){
		for (unsigned int j = 1; j < cityList[i][0].first; j++){
			int dest = cityList[i][j].first;
			int destP = cityList[i][j].second;
			if (dest == cities - 1){
				v[i].push_back(make_pair(dest, destP));
			}
			else{
				for (unsigned int k = 1; k < cityList[dest][0].first; k++){
					if (i != cityList[dest][k].first)
						v[i].push_back(make_pair(cityList[dest][k].first, destP));
				}
			}
		}
		delete[] cityList[i];
	}
	delete[] cityList;
	priority_queue<pair<ll, int>> q;
	char t[100001];
	ll *e = new ll[100001];
	for (int i = 1; i <= 100000; i++){
		e[i] = INF;
		t[i] = 0;
	}
	e[0] = 0;
	t[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("%lld\n", e[cities - 1]);
	delete[]e;
	return 0;
}

Test 1

Group: 1

Verdict: RUNTIME ERROR

Test 2

Group: 1

Verdict: RUNTIME ERROR

Test 3

Group: 1

Verdict: RUNTIME ERROR

Test 4

Group: 1

Verdict: RUNTIME ERROR

Test 5

Group: 1

Verdict: RUNTIME ERROR

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