Language: C++

//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;


#include "boost/multiprecision/cpp_int.hpp"
#include "boost/multiprecision/cpp_dec_float.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)


typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void mod_print(ll k){
    ll P=1000;
    rep(y,1,P){
        ll x=mod(y*k);
        if(x+P>=i_7){
            x-=i_7;
        }
        if(abs(x)<=P){
            cout<<x<<"/"<<y<<endl;
            return;
        }
    }
    cout<<"nun"<<endl;
}
//////////////////////////

#define N 5005
ll n,m,p;
vector<l_l>v[N];

void calc(vector<ll>*v,bool *f,ll sta){
    rep(i,0,N-1)f[i]=false;
    f[sta]=true;
    queue<ll>q;q.push(sta);
    while(!q.empty()){
        ll t=q.front();q.pop();
        for(auto x:v[t]){
            if(f[x]==false){
                f[x]=true;
                q.push(x);
            }
        }
    }
}

void check(bool *f){
    vector<ll>a[N],b[N];
    rep(i,1,n){
        for(auto x:v[i]){
            a[i].pb(x.fi);
            b[x.fi].pb(i);
        }
    }
    bool f1[N],f2[N];
    calc(a,f1,1);
    calc(b,f2,n);
    bool f[N];
    rep(i,1,n)f[i]=(f1[i]&f2[i]);
    
}

ll SOLVE(){
    cin>>n>>m>>p;
    rep(i,1,m){
        ll a,b,c;cin>>a>>b>>c;
        v[a].pb({b,c-p});
    }
    bool f[n+1];
    check(f);
    
    ll dp[n+1];rep(i,1,n)dp[i]=-inf;dp[1]=0;
    priority_queue<l_l>q;
    q.push({0,1});
    
    ll cnt=0;
    while(!q.empty()){
        l_l t=q.top();q.pop();
        for(auto x:v[t.se]){
            if(f[x.fi]==false)continue;
            if(chmax(dp[x.fi],dp[t.se]+x.se)){
                q.push({dp[x.fi],x.fi});
                cnt++;
                if(cnt>=4*m){
                    cout<<-1<<endl;return 0;
                }
            }
        }
    }
    cout<<dp[n]<<endl;
    
    return 0;
}

int main(){fastio
    
    clock_t start = clock();
    SOLVE();
    clock_t end = clock();
    const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;
    cerr<<endl<<time<<"ms"<<endl;
    
    return 0;
}


Compiler output:
a.cc:7:10: fatal error: boost/multiprecision/cpp_int.hpp: No such file or directory
    7 | #include "boost/multiprecision/cpp_int.hpp"
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.