Language: C++

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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;

#define fi          first
#define se          second
#define pb          push_back
#define INF         INT_MAX
#define bcnt        __builtin_popcount
#define all(x)      (x).begin(),(x).end()
#define dbg(x)      cout<<#x"="<<x<<endl
#define uni(x)      x.erase(unique(all(x)),x.end())
#define ub(x,y)     upper_bound(all(x),y)-x.begin()
#define lb(x,y)     lower_bound(all(x),y)-x.begin()
#define rep(i,n)    repl(i,0,n-1)
#define usort(x)    sort(all(x))
#define dsort(x)    sort(all(x),greater<ll>())
#define mkp(x,y)    make_pair(x,y)
#define mmax(x,y)   (x>y?x:y)
#define mmin(x,y)   (x<y?x:y)
#define maxch(x,y)  x=mmax(x,y)
#define minch(x,y)  x=mmin(x,y)
#define exist(x,y)  (find(all(x),y)!=x.end())
#define each(itr,v) for(auto itr:v)
#define repl(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)

struct edge{
  ll f,t,c;
};

ll n,m;
ll cnt = 101010;
vector<edge> es;
vector<P> g(cnt);
vector<bool> used(cnt);
Vector d(cnt);

int main(){
  cin >> n >> m;
  rep(i,m){
    ll a,b,c;
    cin>> a >> b >> c;
    a--;
    b--;
    g[a].pb(P(b,c));
    used[b] = true;
    es.pb(edge{a,b,c});
  }
  priority_queue<P, vector<P>, greater<P> > que;
  rep(i,n){
    d[i] = INF;
    if(used[i])continue;
    que.push(P(0,i));
  }
  while(que.size() > 0){
    ll v = que.top().se;
    ll nd = que.top().fi;
    que.pop();
    if(d[v] != INF)continue;
    d[v] = nd;
    each(e, g[v])que.push(P(nd+e.se, e.fi));
  }
  bool ok = true;
  rep(i,m){
    ll v = es[i].f, u = es[i].t, nc = es[i].c;
    if(d[v] + nc != d[u])ok = false;
  }
  if(ok)cout << "Yes" << endl;
  else cout << "No" << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:12:21: error: '__gnu_cxx::__alloc_traits<std::allocator<std::pair<long long int, long long int> >, std::pair<long long int, long long int> >::value_type' {aka 'struct std::pair<long long int, long long int>'} has no member named 'push_back'
   12 | #define pb          push_back
      |                     ^~~~~~~~~
a.cc:50:10: note: in expansion of macro 'pb'
   50 |     g[a].pb(P(b,c));
      |          ^~
a.cc:66:16: error: no matching function for call to 'begin(std::pair<long long int, long long int>&)'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
In file included from /usr/include/c++/14/bits/algorithmfwd.h:39,
                 from /usr/include/c++/14/bits/stl_algo.h:59,
                 from /usr/include/c++/14/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/initializer_list:88:5: note: candidate: 'template<class _Tp> constexpr const _Tp* std::begin(initializer_list<_Tp>)'
   88 |     begin(initializer_list<_Tp> __ils) noexcept
      |     ^~~~~
/usr/include/c++/14/initializer_list:88:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   'std::pair<long long int, long long int>' is not derived from 'std::initializer_list<_Tp>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
In file included from /usr/include/c++/14/string:53,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/range_access.h:52:5: note: candidate: 'template<class _Container> constexpr decltype (__cont.begin()) std::begin(_Container&)'
   52 |     begin(_Container& __cont) -> decltype(__cont.begin())
      |     ^~~~~
/usr/include/c++/14/bits/range_access.h:52:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/range_access.h: In substitution of 'template<class _Container> constexpr decltype (__cont.begin()) std::begin(_Container&) [with _Container = std::pair<long long int, long long int>]':
a.cc:66:5:   required from here
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
/usr/include/c++/14/bits/range_access.h:52:50: error: 'struct std::pair<long long int, long long int>' has no member named 'begin'
   52 |     begin(_Container& __cont) -> decltype(__cont.begin())
      |                                           ~~~~~~~^~~~~
/usr/include/c++/14/bits/range_access.h:63:5: note: candidate: 'template<class _Container> constexpr decltype (__cont.begin()) std::begin(const _Container&)'
   63 |     begin(const _Container& __cont) -> decltype(__cont.begin())
      |     ^~~~~
/usr/include/c++/14/bits/range_access.h:63:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/range_access.h: In substitution of 'template<class _Container> constexpr decltype (__cont.begin()) std::begin(const _Container&) [with _Container = std::pair<long long int, long long int>]':
a.cc:66:5:   required from here
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
/usr/include/c++/14/bits/range_access.h:63:56: error: 'const struct std::pair<long long int, long long int>' has no member named 'begin'
   63 |     begin(const _Container& __cont) -> decltype(__cont.begin())
      |                                                 ~~~~~~~^~~~~
/usr/include/c++/14/bits/range_access.h:95:5: note: candidate: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::begin(_Tp (&)[_Nm])'
   95 |     begin(_Tp (&__arr)[_Nm]) noexcept
      |     ^~~~~
/usr/include/c++/14/bits/range_access.h:95:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   mismatched types '_Tp [_Nm]' and 'std::pair<long long int, long long int>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:166:
/usr/include/c++/14/valarray:1227:5: note: candidate: 'template<class _Tp> _Tp* std::begin(valarray<_Tp>&)'
 1227 |     begin(valarray<_Tp>& __va) noexcept
      |     ^~~~~
/usr/include/c++/14/valarray:1227:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   'std::pair<long long int, long long int>' is not derived from 'std::valarray<_Tp>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
/usr/include/c++/14/valarray:1238:5: note: candidate: 'template<class _Tp> const _Tp* std::begin(const valarray<_Tp>&)'
 1238 |     begin(const valarray<_Tp>& __va) noexcept
      |     ^~~~~
/usr/include/c++/14/valarray:1238:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   'std::pair<long long int, long long int>' is not derived from 'const std::valarray<_Tp>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
a.cc:66:16: error: no matching function for call to 'end(std::pair<long long int, long long int>&)'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
/usr/include/c++/14/initializer_list:99:5: note: candidate: 'template<class _Tp> constexpr const _Tp* std::end(initializer_list<_Tp>)'
   99 |     end(initializer_list<_Tp> __ils) noexcept
      |     ^~~
/usr/include/c++/14/initializer_list:99:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   'std::pair<long long int, long long int>' is not derived from 'std::initializer_list<_Tp>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
/usr/include/c++/14/bits/range_access.h:74:5: note: candidate: 'template<class _Container> constexpr decltype (__cont.end()) std::end(_Container&)'
   74 |     end(_Container& __cont) -> decltype(__cont.end())
      |     ^~~
/usr/include/c++/14/bits/range_access.h:74:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/range_access.h: In substitution of 'template<class _Container> constexpr decltype (__cont.end()) std::end(_Container&) [with _Container = std::pair<long long int, long long int>]':
a.cc:66:5:   required from here
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
/usr/include/c++/14/bits/range_access.h:74:48: error: 'struct std::pair<long long int, long long int>' has no member named 'end'
   74 |     end(_Container& __cont) -> decltype(__cont.end())
      |                                         ~~~~~~~^~~
/usr/include/c++/14/bits/range_access.h:85:5: note: candidate: 'template<class _Container> constexpr decltype (__cont.end()) std::end(const _Container&)'
   85 |     end(const _Container& __cont) -> decltype(__cont.end())
      |     ^~~
/usr/include/c++/14/bits/range_access.h:85:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/range_access.h: In substitution of 'template<class _Container> constexpr decltype (__cont.end()) std::end(const _Container&) [with _Container = std::pair<long long int, long long int>]':
a.cc:66:5:   required from here
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
/usr/include/c++/14/bits/range_access.h:85:54: error: 'const struct std::pair<long long int, long long int>' has no member named 'end'
   85 |     end(const _Container& __cont) -> decltype(__cont.end())
      |                                               ~~~~~~~^~~
/usr/include/c++/14/bits/range_access.h:106:5: note: candidate: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::end(_Tp (&)[_Nm])'
  106 |     end(_Tp (&__arr)[_Nm]) noexcept
      |     ^~~
/usr/include/c++/14/bits/range_access.h:106:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   mismatched types '_Tp [_Nm]' and 'std::pair<long long int, long long int>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
/usr/include/c++/14/valarray:1249:5: note: candidate: 'template<class _Tp> _Tp* std::end(valarray<_Tp>&)'
 1249 |     end(valarray<_Tp>& __va) noexcept
      |     ^~~
/usr/include/c++/14/valarray:1249:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   'std::pair<long long int, long long int>' is not derived from 'std::valarray<_Tp>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^
/usr/include/c++/14/valarray:1265:5: note: candidate: 'template<class _Tp> const _Tp* std::end(const valarray<_Tp>&)'
 1265 |     end(const valarray<_Tp>& __va) noexcept
      |     ^~~
/usr/include/c++/14/valarray:1265:5: note:   template argument deduction/substitution failed:
a.cc:66:16: note:   'std::pair<long long int, long long int>' is not derived from 'const std::valarray<_Tp>'
   66 |     each(e, g[v])que.push(P(nd+e.se, e.fi));
      |                ^
a.cc:29:34: note: in definition of macro 'each'
   29 | #define each(itr,v) for(auto itr:v)
      |                                  ^