Lennot

#include <iostream>
#include <algorithm>
using namespace std;

long k = 999999999;

long f(long n, long** v, long p[], long r[], long t, long e, long s, long x){
    if (v[e][s] == -1) return 0;
    if (k <= x + (t % 2)*v[e][s]) return 0;
    if (s == n) {
        k = x + (t % 2)*v[e][s];
        return 0;
    }
    if (t % 2 == 0){
        if (p[s] >= 0 && p[s] <= x) return 0;
        p[s] = x;
    } else {
        x += v[e][s];
        if (r[s] >= 0 && r[s] <= x) return 0;
        r[s] = x;
    }
    long y = x;
    for (long i = 1; i <= n; ++i){
        if (p[i] == -1 && r[i] == -1) y += f(n, v, p, r, (t+1)%2, s, i, x);
    }
    for (long i = 1; i <= n; ++i){
        if (p[i] >= 0 || r[i] >= 0) y += f(n, v, p, r, (t+1)%2, s, i, x);
    }
    return y;
}

int main(int argc, char** argv) {
    long n, m, a, b, h;
    cin >> n >> m;
    long** v = new long*[n+1];
    long p[n+1], r[n+1];
    for(long i = 0; i <= n; i++) {
        v[i] = new long[n+1];
        p[i] = -1;
        r[i] = -1;
        for(long j = 0; j <= n; j++) { 
            v[i][j] = -1;
        }
    }
    for (long i = 0; i < m; ++i){
        cin >> a >> b >> h;
        if (v[a][b] >= 0 && v[a][b] <= h) continue;
        v[a][b] = h;
    }
    v[0][1] = 0;
    f(n,v,p,r,0,0,1,0);
    cout << k;
    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: 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