Submission #58209585

---

Source Code Expand

//yukicoder@cpp17

#include <iostream>
#include <iomanip>

#include <algorithm>

#include <cmath>
#include <cctype>
#include <climits>
#include <cassert>

#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>

#include <random>

#include <bitset>

#include <complex>

#include <utility>

#include <numeric>

#include <functional>


using namespace std;
using ll = long long;
using P = pair<ll,ll>;


const ll MOD = 998244353;
const ll MODx = 1000000007;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62LL)-1;
const double EPS = (1e-10);


P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};
P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};


template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
 
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる

計算量は変わらないが楽できるシリーズ
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/

/* comment outed because can cause bugs
__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}
*/
int main(){
  int n,m;cin>>n>>m;
  vector<pair<int,long long>> A[n];
  for(int i = 0; m > i; i++){
    long long u,v,w;cin>>u>>v>>w;
    u--;v--;
    A[u].push_back({v, w});
    A[v].push_back({u, -w});
  }

  vector<bool> ansed(n, false);
  vector<long long> ans(n, 0);
  ansed[0] = true;
  stack<int> nxt;
  for(int i = n-1; 0 <= i; i--)nxt.push(i);
  while(nxt.size()){
    int i = nxt.top();nxt.pop();
    ansed[i] = true;
    for(int j = 0; A[i].size() > j; j++){
      if(ansed[i] && ansed[A[i][j].first]){
        assert(ans[A[i][j].first]-ans[i] == A[i][j].second);
        continue;
      }

      if(ansed[i]){
        ansed[A[i][j].first] = true;
        ans[A[i][j].first] = A[i][j].second + ans[i];
        nxt.push(A[i][j].first);
      }
    }
  }
  for(int i = 0; n > i; i++){
    cout << ans[i] << " \n"[i+1 == n];
  }


  return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:86:32: warning: comparison of integer expressions of different signedness: ‘std::vector<std::pair<int, long long int> >::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   86 |     for(int j = 0; A[i].size() > j; j++){
      |                    ~~~~~~~~~~~~^~~

Judge Result