Lennot

#include <string.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>

using namespace std;

#define ull unsigned long long

int n;
int * flights;
int * paid;

ull rec_price(int city, int free) {
	ull p = 100000000000000;
	if (city == (n - 1))
		return 0;
	int c = city*n;
	for(int i = 0; i < n; ++i) {
		if(flights[c+i] < 0) continue;
		if(paid[i] < 3) {
			if (!free) {
				paid[city]++;
			}
			ull r = rec_price(i, !free) + (free?0:flights[c+i]);
			p = min(p,r);
		}
	}
	if (free) {
		paid[city]--;
	}
	return p;
}
/*
4 6
1 2 5
2 3 8
2 1 4
3 1 6
3 4 1
4 2 3
*/
int main() {
    cin.sync_with_stdio(false);
	int m;
    cin >> n >> m;
    flights = new int[n*n];
	paid = new int[n];
	int a, b, c;
	for (int i = 0; i < n*n; i++) {
		flights[i] = -1;
		if (i < n) paid[i] = 0;
	}
	for (int i = 0; i < m; i++) {
		cin >> a >> b >> c;
		a--;
		b--;
		flights[a*n+b] = c;
	}
	/*for (int a = 0; a < n; a++) {
		for(int b = 0; b < n; b++) {
			int j = a*n+b;
			if (flights[j] < 0) continue;
			printf("%d %d %d\n",a+1,b+1,flights[j]);
		}
	}
	printf("=VEC\n");
	for (int i = 0; i < n; i++) {
		vector<int> v = flights[i];
		for(vector<int>::iterator it = v.begin(); it != v.end(); ++it, ++it) {
			printf("%d %d %d\n",i+1,*it,*(it+1));
		}
	}*/
    cout << rec_price(0, 0) << "\n";
    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: 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: 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