Problem p03305 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n)                                                          \
  for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n)                                                         \
  for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;

vpll G[200100];
ll dist[200100];

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n, m, s, t;
  cin >> n >> m >> s >> t;
  s--, t--;
  rep(i, m) {
    ll u, v, a, b;
    cin >> u >> v >> a >> b;
    u--, v--;
    G[u].emplace_back(v, a);
    G[v].emplace_back(u, a);
    ll nu = n + u, nv = n + v;
    G[nu].emplace_back(nv, b);
    G[nv].emplace_back(nu, b);
  }

  priority_queue<pll> q;
  q.emplace(0, s);
  q.emplace(0, t + n);
  ll inf = 1e15;
  rep(i, 2 * n + 1) dist[i] = inf;
  dist[s] = dist[t + n] = 0;

  while (!q.empty()) {
    auto p = q.top();
    q.pop();
    ll v = p.second, c = p.first;
    if (dist[v] < c)
      continue;
    for (auto np : G[v]) {
      ll nv = np.first, nc = np.second;
      if (chmin(dist[nv], dist[v] + nc)) {
        q.emplace(dist[nv], nv);
      }
    }
  }

  ll base = 1e15;
  ll prev = 0;
  vll ans(n);
  rrep(i, n) {
    chmax(prev, base - (dist[i] + dist[n + i]));
    ans[i] = prev;
  }
  rep(i, n) { cout << ans[i] << endl; }
}


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

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n)                                                          \
  for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n)                                                         \
  for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;

vpll G[200100];
ll dist[200100];

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n, m, s, t;
  cin >> n >> m >> s >> t;
  s--, t--;
  rep(i, m) {
    ll u, v, a, b;
    cin >> u >> v >> a >> b;
    u--, v--;
    G[u].emplace_back(v, a);
    G[v].emplace_back(u, a);
    ll nu = n + u, nv = n + v;
    G[nu].emplace_back(nv, b);
    G[nv].emplace_back(nu, b);
  }

  priority_queue<pll, vector<pll>, greater<pll>> q;
  q.emplace(0, s);
  q.emplace(0, t + n);
  ll inf = 1e15;
  rep(i, 2 * n + 1) dist[i] = inf;
  dist[s] = dist[t + n] = 0;

  while (!q.empty()) {
    auto p = q.top();
    q.pop();
    ll v = p.second, c = p.first;
    if (dist[v] < c)
      continue;
    for (auto np : G[v]) {
      ll nv = np.first, nc = np.second;
      if (chmin(dist[nv], dist[v] + nc)) {
        q.emplace(dist[nv], nv);
      }
    }
  }

  ll base = 1e15;
  ll prev = 0;
  vll ans(n);
  rrep(i, n) {
    chmax(prev, base - (dist[i] + dist[n + i]));
    ans[i] = prev;
  }
  rep(i, n) { cout << ans[i] << endl; }
}