Problem p02703 (C++) — buggy submission, verdict: Time Limit Exceeded

// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
  is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
      // cin.tie(nullptr); ios::sync_with_stdio(0);
      cout << setprecision(15) << fixed;
  }
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------

signed main() {
  int N, M, S;
  cin >> N >> M >> S;
  const int MX = 50 * 50;
  vector<vector<vector<pair<pii, int>>>> G(
      N, vector<vector<pair<pii, int>>>(MX + 1));
  rep(i, 0, M) {
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    u--, v--;
    rep(j, 0, MX + 1) {
      if (j - a >= 0) {
        G[u][j].push_back({{v, j - a}, b});
        G[v][j].push_back({{u, j - a}, b});
      }
    }
  }
  vi C(N), D(N);
  rep(i, 0, N) { cin >> C[i] >> D[i]; }
  rep(i, 0, N) {
    rep(j, 0, MX + 1) { G[i][j].push_back({{i, min(MX, j + C[i])}, D[i]}); }
  }

  heap<pair<int, pii>> q;
  vvi dist(N, vi(MX + 1, INF));
  dist[0][min(MX, S)] = 0;
  q.push({0, {0, min(MX, S)}});
  while (sz(q)) {
    int d;
    pii v;
    tie(d, v) = q.top();
    q.pop();
    if (d > dist[v.first][v.second])
      continue;
    for (auto e : G[v.first][v.second]) {
      pii w = e.first;
      if (chmin(dist[w.first][w.second], dist[v.first][v.second] + e.second)) {
        q.emplace(dist[w.first][w.second], w);
      }
    }
  }

  rep(i, 1, N) {
    int ans = INF;
    rep(j, 0, MX + 1) { chmin(ans, dist[i][j]); }
    cout << ans << endl;
  }
  return (0 ^ _ ^ 0);
}


Error: TLE

Fixed submission:

// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
  is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
      // cin.tie(nullptr); ios::sync_with_stdio(0);
      cout << setprecision(15) << fixed;
  }
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------

signed main() {
  int N, M, S;
  cin >> N >> M >> S;
  const int MX = 50 * 100 * 50;
  vector<vector<vector<pair<pii, int>>>> G(
      N, vector<vector<pair<pii, int>>>(MX + 1));
  rep(i, 0, M) {
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    u--, v--;
    rep(j, 0, MX + 1) {
      if (j - a >= 0) {
        G[u][j].push_back({{v, j - a}, b});
      }
      if (j - a >= 0) {
        G[v][j].push_back({{u, j - a}, b});
      }
    }
  }
  vi C(N), D(N);
  rep(i, 0, N) { cin >> C[i] >> D[i]; }
  rep(i, 0, N) {
    rep(j, 0, MX + 1) { G[i][j].push_back({{i, min(MX, j + C[i])}, D[i]}); }
  }

  heap<pair<int, pii>> q;
  vvi dist(N, vi(MX + 1, INF));
  dist[0][min(MX, S)] = 0;
  q.push({0, {0, min(MX, S)}});
  while (sz(q)) {
    int d;
    pii v;
    tie(d, v) = q.top();
    q.pop();
    if (d > dist[v.first][v.second])
      continue;
    for (auto e : G[v.first][v.second]) {
      pii w = e.first;
      if (chmin(dist[w.first][w.second], dist[v.first][v.second] + e.second)) {
        q.emplace(dist[w.first][w.second], w);
      }
    }
  }

  rep(i, 1, N) {
    int ans = INF;
    rep(j, 0, MX + 1) { chmin(ans, dist[i][j]); }
    cout << ans << endl;
  }
  return (0 ^ _ ^ 0);
}