Language: C++

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(), (x).end()

typedef int64_t ll;

const ll INF = 1e9;

typedef ll Weight;
struct Edge {
  int src, dst;
  Weight weight;
  Edge(int src, int dst) : src(src), dst(dst), weight(1) {}
  Edge(int src, int dst, Weight weight) :
    src(src), dst(dst), weight(weight) { }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

// ref: http://www.prefield.com/algorithm/graph/bellman_ford.html
bool shortestPath(const Graph g, int s, vector<Weight> &dist) {
  // Graph g has negative loop iff return false
  // O(VE)
  int n = g.size();
  dist.assign(n, INF + INF); dist[s] = 0;
  bool negative_cycle = false;
  REP(k, n) REP(i, n) for(Edge e : g[i]) {
    if (dist[e.dst] > dist[e.src] + e.weight) {
      dist[e.dst] = dist[e.src] + e.weight;
      if (k == n - 1) {
        dist[e.dst] = -INF;
        negative_cycle = true;
      }
    }
  }
  return !negative_cycle;
}

int main(){
  int N, M, P;
  cin >> N >> M >> P;
  Graph g(N);
  REP(i, M) {
    int A, B, C;
    cin >> A >> B >> C; --A; --B;
    g[A].push_back(Edge(A, B, P - C));
  }

  vector<Weight> dist(N);
  bool normal = shortestPath(g, 0, dist);
  ll ret = -1;
  if (dist[N - 1] != -INF) {
    ret = max(-dist[N - 1], 0LL);
  }

  cout << ret << endl;
  return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:55:14: error: no matching function for call to 'max(__gnu_cxx::__alloc_traits<std::allocator<long int>, long int>::value_type, long long int)'
   55 |     ret = max(-dist[N - 1], 0LL);
      |           ~~~^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:55:14: note:   deduced conflicting types for parameter 'const _Tp' ('long int' and 'long long int')
   55 |     ret = max(-dist[N - 1], 0LL);
      |           ~~~^~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:55:14: note:   mismatched types 'std::initializer_list<_Tp>' and 'long int'
   55 |     ret = max(-dist[N - 1], 0LL);
      |           ~~~^~~~~~~~~~~~~~~~~~~