Problem:
Score : 500 points

Problem Statement

There is a directed graph with N vertices numbered 1 to N and M edges.
The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge.
Additionally, there is a button on Vertex N.

We will play a game on this graph.
You start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.
It takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.
As usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.

When you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)
However, when you end the game, you will be asked to pay T \times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \times P coins, you will have to pay all of your coins instead.

Your score will be the number of coins you have after this payment.
Determine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.

Constraints

2 \leq N \leq 2500

1 \leq M \leq 5000

1 \leq A_i, B_i \leq N

1 \leq C_i \leq 10^5

0 \leq P \leq 10^5

All values in input are integers.

Vertex N can be reached from Vertex 1.

Input

Input is given from Standard Input in the following format:

N M P
A_1 B_1 C_1
:
A_M B_M C_M

Output

If there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.

Sample Input 1

3 3 10
1 2 20
2 3 30
1 3 45

Sample Output 1

35

There are two ways to travel from Vertex 1 to Vertex 3:

Vertex 1 \rightarrow 2 \rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \times 10 = 20 coins, and you have 50 - 20 = 30 coins left.

Vertex 1 \rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \times 10 = 10 coins, and you have 45 - 10 = 35 coins left.

Thus, the maximum score that can be obtained is 35.

Sample Input 2

2 2 10
1 2 100
2 2 100

Sample Output 2

-1

The edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.

Sample Input 3

4 5 10
1 2 1
1 4 1
3 4 1
2 2 100
3 3 100

Sample Output 3

0

There is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.

Note that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::borrow::BorrowMut;
use std::cmp::max;
use std::fs::File;
use std::io::{stdout, BufWriter, Read, Write};
use std::thread;

fn main() {
    thread::Builder::new()
        .stack_size(32 * 1024 * 1024) // 32MB
        .spawn(run)
        .unwrap()
        .join()
        .unwrap();
}

/// ローカル環境なら _in.txt から入力を受ける
fn read_input() -> String {
    let stdin = std::io::stdin();
    let mut s = String::new();
    match option_env!("LOCAL") {
        Some(_) => File::open("src/_in.txt")
            .expect("File not found")
            .read_to_string(&mut s)
            .unwrap(),
        None => stdin.lock().read_to_string(&mut s).unwrap(),
    };
    s
}

fn bellman_ford(graph: &Vec<Vec<(usize, i64)>>, from_v: usize, to_v: usize) -> Option<i64> {
    /// graph 上で from_v から到達できるかどうかのベクタ
    fn reachable(graph: &Vec<Vec<(usize, i64)>>, from_v: usize) -> Vec<bool> {
        let mut ret: Vec<bool> = vec![false; graph.len()];
        ret[from_v] = true;

        // dfs
        let mut stack: Vec<usize> = vec![];
        stack.push(from_v);
        while let Some(v) = stack.pop() {
            for &(u, _) in &graph[v] {
                if !ret[u] {
                    ret[u] = true;
                    stack.push(u);
                }
            }
        }
        ret
    }

    // from_v から到達でき、かつ to_v へ到達できる頂点のみ考える
    // これら以外には負閉路があっても関係ない
    let mut vertices: Vec<usize> = vec![];
    let mut rev: Vec<Vec<(usize, i64)>> = vec![vec![]; graph.len()];
    for (v, edges) in graph.iter().enumerate() {
        for &(u, d) in edges {
            rev[u].push((v, d));
        }
    }
    let r1 = reachable(&graph, from_v);
    let r2 = reachable(&rev, to_v);
    for v in 0..graph.len() {
        if r1[v] && r2[v] {
            vertices.push(v);
        }
    }

    // bellman ford
    let inf = i64::pow(10, 18);
    let mut dist = vec![inf; graph.len()];
    dist[from_v] = 0;
    let mut updated = true;
    for _ in 0..graph.len() {
        updated = false;
        for v in &vertices {
            for &(u, d) in &graph[*v] {
                if dist[*v] + d < dist[u] {
                    dist[u] = dist[*v] + d;
                    updated = true;
                }
            }
        }
        if !updated {
            break;
        }
    }

    if !updated && dist[to_v] < inf {
        Some(dist[to_v])
    } else {
        None
    }
}

fn run() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    let input = read_input();
    let mut input = input.split_whitespace();

    let in_n: i64 = input.next().unwrap().parse().unwrap();
    let in_m: i64 = input.next().unwrap().parse().unwrap();
    let in_p: i64 = input.next().unwrap().parse().unwrap();
    let abc: Vec<(i64, i64, i64)> = (0..in_m)
        .map(|_| {
            let r: Vec<i64> = input
                .borrow_mut()
                .take(3 as usize)
                .map(|s| s.parse().unwrap())
                .collect();
            (r[0], r[1], r[2])
        })
        .collect();

    let mut graph: Vec<Vec<(usize, i64)>> = vec![vec![]; in_n as usize];
    for (a, b, c) in abc {
        graph[a as usize - 1].push((b as usize - 1, in_p - c));
    }

    if let Some(dist) = bellman_ford(&graph, 0, in_n as usize - 1) {
        writeln!(out, "{}", max(-dist, 0)).ok();
    } else {
        writeln!(out, "{}", -1).ok();
    }
}