Language: C++

#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
long long po(long a, long b){
    if(b==0){
        return 1;
    }
    
    long long z = po(a,b/2);
    z = mod(z*z);
    if(b%2!=0){
        z = mod(a*z);
    }
    return z;
}
 
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=std::sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}
 
long long gcd_(long long a, long long b){
  if(a<b){
    std::swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}

using namespace std;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

vector<int> G[2505];
vector<int> rG[2505];
bool reachable_0[2505];
bool reachable_N[2505];
bool reachable[2505];

void dfs_0(int v = 0){
  if(reachable_0[v]) return;
  reachable_0[v] = true;
  for(auto& nv: G[v]) dfs_0(nv);
  return;
}
void dfs_N(int v){
  if(reachable_N[v]) return;
  reachable_N[v] = true;
  for(auto& nv: rG[v]) dfs_N(nv);
  return;
}

struct edge{
  int src, dst;
  long long cost;
};

int main(){
  using namespace std;
  int n, m;
  long long p;
  cin>>n>>m>>p;
  int a[m], b[m];
  long long c[m];
  REP(i, m){
    cin>>a[i]>>b[i]>>c[i];
    a[i]--; b[i]--;
  }
  
  REP(i, m){
    G[a[i]].push_back(b[i]);
    rG[b[i]].push_back(a[i]);
  }
  dfs_0(); dfs_N(n - 1);
  REP(i, n) reachable[i] = reachable_0[i] && reachable_N[i];
  
  vector<edge> edges;
  REP(i, m){
    if(!reachable[a[i]] || !reachable[b[i]]) continue;
    edges.push_back({a[i], b[i], -(c[i] - p)});
  }
  
  vector<logn long> dist(n, INF);
  dist[0] = 0;
  REP(_, n - 1){
    for(auto& e: edges){
      int src = e.src, dst = e.dst;
      if(dist[dst] > dist[src] + e.cost) dist[dst] = dist[src] + e.cost;
    }
  }
  for(auto& e: edges){
    int src = e.src, dst = e.dst;
    if(dist[dst] > dist[src] + e.cost){
      cout << -1 << endl;
      return 0;
    }
  }
  
  long long ans = max(0, -dst[n - 1]);
  cout << ans << endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:118:10: error: 'logn' was not declared in this scope; did you mean 'long'?
  118 |   vector<logn long> dist(n, INF);
      |          ^~~~
      |          long
a.cc:118:19: error: template argument 1 is invalid
  118 |   vector<logn long> dist(n, INF);
      |                   ^
a.cc:118:19: error: template argument 2 is invalid
a.cc:118:32: error: expression list treated as compound expression in initializer [-fpermissive]
  118 |   vector<logn long> dist(n, INF);
      |                                ^
a.cc:118:32: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+17' to '2147483647' [-Woverflow]
a.cc:119:7: error: invalid types 'int[int]' for array subscript
  119 |   dist[0] = 0;
      |       ^
a.cc:123:14: error: invalid types 'int[int]' for array subscript
  123 |       if(dist[dst] > dist[src] + e.cost) dist[dst] = dist[src] + e.cost;
      |              ^
a.cc:123:26: error: invalid types 'int[int]' for array subscript
  123 |       if(dist[dst] > dist[src] + e.cost) dist[dst] = dist[src] + e.cost;
      |                          ^
a.cc:123:46: error: invalid types 'int[int]' for array subscript
  123 |       if(dist[dst] > dist[src] + e.cost) dist[dst] = dist[src] + e.cost;
      |                                              ^
a.cc:123:58: error: invalid types 'int[int]' for array subscript
  123 |       if(dist[dst] > dist[src] + e.cost) dist[dst] = dist[src] + e.cost;
      |                                                          ^
a.cc:128:12: error: invalid types 'int[int]' for array subscript
  128 |     if(dist[dst] > dist[src] + e.cost){
      |            ^
a.cc:128:24: error: invalid types 'int[int]' for array subscript
  128 |     if(dist[dst] > dist[src] + e.cost){
      |                        ^
a.cc:134:27: error: 'dst' was not declared in this scope; did you mean 'dist'?
  134 |   long long ans = max(0, -dst[n - 1]);
      |                           ^~~
      |                           dist