Problem p02703 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i <= (ll)(n); i++)
#define per(i, j, n) for (ll i = (ll)(j); (ll)(n) <= i; i--)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (ll)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//
#define endl "\n"
// using std::endl;
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll, ll>;
//
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD=998244353;
// constexpr ll MOD=10000000;
// constexpr ll MOD=1e5;
constexpr ll MAX = 1e7;
constexpr ll INF = (1ll << 62);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <typename T> struct Segment_tree {
  ll N;
  T mem;
  vector<T> node;
  Segment_tree(vector<T> &X, T m) : mem(m) {
    ll sz = X.size();
    N = 1;
    while (N < sz)
      N *= 2;
    node.resize(2 * N - 1, mem);
    rep(i, 0, sz) node[N - 1 + i] = X[i];
    per(i, N - 2, 0) { node[i] = Compare(node[i * 2 + 1], node[i * 2 + 2]); }
  }
  T Compare(T &A, T &B) { return std::max(A, B); }
  void update(ll X, T val) {
    X += N - 1;
    node[X] = val;
    while (X > 0) {
      X = (X - 1) / 2;
      node[X] = Compare(node[X * 2 + 1], node[X * 2 + 2]);
    }
  }
  T Query(ll a, ll b, ll now, ll l, ll r) { //[a,b),[l,r)
    if (r < 0)
      r = N;
    if (r <= a || b <= l)
      return mem;
    if (a <= l && r <= b)
      return node[now];
    auto vl = Query(a, b, now * 2 + 1, l, (l + r) / 2),
         vr = Query(a, b, now * 2 + 2, (l + r) / 2, r);
    return Compare(vl, vr);
  }
};
struct Binary_indexed_tree {
  int N;
  vi bit;
  Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
  void add(int x, int a) {
    for (x; x <= N; x += (x & -x))
      bit[x] += a;
  }
  ll sum(int x) {
    ll ret = 0;
    for (x; x > 0; x -= (x & -x))
      ret += bit[x];
    return ret;
  }
  ll lower_bound(ll X) {
    if (sum(N) < X)
      return -1;
    ll ret = 0, memo = 1, sum = 0;
    while (memo * 2 <= N)
      memo *= 2;
    while (memo > 0) {
      if (memo + ret <= N && sum + bit[memo + ret] < X) {
        sum += bit[memo + ret];
        ret += memo;
      }
      memo /= 2;
    }
    return ret + 1;
  }
};
struct Union_Find {
  ll N;
  vi par;
  vi siz;
  Union_Find(int n) : N(n) {
    par.resize(N);
    siz.resize(N, 1);
    rep(i, 0, N) par[i] = i;
  }
  ll root(ll X) {
    if (par[X] == X)
      return X;
    return par[X] = root(par[X]);
  }
  bool same(ll X, ll Y) { return root(X) == root(Y); }
  void unite(ll X, ll Y) {
    X = root(X);
    Y = root(Y);
    if (X == Y)
      return;
    par[X] = Y;
    siz[Y] += siz[X];
    siz[X] = 0;
  }
  ll size(ll X) { return siz[root(X)]; }
};
long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
vi fac, finv, inv;
void COMinit() {
  fac.resize(MAX);
  finv.resize(MAX);
  inv.resize(MAX);
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
ll COM(ll n, ll r) {
  if (n < r || n < 0 || r < 0)
    return 0;
  return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    std::swap(a, b);
    u -= t * v;
    std::swap(u, v);
  }
  u %= m;
  if (u < 0)
    u += m;
  return u;
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  ll N, M, S;
  cin >> N >> M >> S;
  vector<vector<std::tuple<ll, ll, ll>>> edge(N);
  rep(i, 0, M) {
    ll U, V, A, B;
    cin >> U >> V >> A >> B;
    edge[U - 1].pb(std::make_tuple(V - 1, A, B));
    edge[V - 1].pb(std::make_tuple(U - 1, A, B));
  }
  vi C(N), D(N);
  rep(i, 0, N) cin >> C[i] >> D[i];
  constexpr ll max = 25000;
  S = std::min(S, max);
  vector<vii> dp(N, vii(N, vi(max + 1, INF)));
  prique<std::tuple<ll, ll, ll, ll>> que;
  ll m = S, c = 0;
  while (m <= max) {
    que.push(std::make_tuple(c * D[0], m, 0, 0));
    dp[0][0][m] = c * D[0];
    m += C[0];
    c++;
  }
  while (!que.empty()) {
    ll time, money, from, X;
    std::tie(time, money, from, X) = que.top();
    que.pop();
    if (dp[X][from][money] < time)
      continue;
    rep(i, 0, edge[X].size()) {
      ll Y, silver, dist;
      std::tie(Y, silver, dist) = edge[X][i];
      silver = money - silver;
      dist += time;
      if (silver < 0) {
        ll memo = (abs(silver) + C[from] - 1) / C[from];
        dist += memo * D[from];
        silver += memo * C[from];
        silver = std::min(silver, max);
      }
      if (dp[Y][from][silver] > dist) {
        dp[Y][from][silver] = dist;
        que.push(std::make_tuple(dist, silver, from, Y));
      }
      silver += C[from];
      dist += D[from];
      if (silver < 0) {
        ll memo = (abs(silver) + C[from] - 1) / C[from];
        dist += memo * D[from];
        silver += memo * C[from];
        silver = std::min(silver, max);
      }
    }
    from = X;
    if (dp[X][from][money] > time) {
      dp[X][from][money] = time;
      que.push(std::make_tuple(time, money, from, X));
    }
  }
  rep(i, 1, N) {
    ll ans = INF;
    rep(j, 0, N) {
      REP(k, 0, max) {
        ll sum = dp[i][j][k];
        ans = std::min(ans, sum);
      }
    }
    cout << ans << endl;
  }
}


Fixed submission:
#include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i <= (ll)(n); i++)
#define per(i, j, n) for (ll i = (ll)(j); (ll)(n) <= i; i--)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (ll)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//
#define endl "\n"
// using std::endl;
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll, ll>;
//
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD=998244353;
// constexpr ll MOD=10000000;
// constexpr ll MOD=1e5;
constexpr ll MAX = 1e7;
constexpr ll INF = (1ll << 62);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <typename T> struct Segment_tree {
  ll N;
  T mem;
  vector<T> node;
  Segment_tree(vector<T> &X, T m) : mem(m) {
    ll sz = X.size();
    N = 1;
    while (N < sz)
      N *= 2;
    node.resize(2 * N - 1, mem);
    rep(i, 0, sz) node[N - 1 + i] = X[i];
    per(i, N - 2, 0) { node[i] = Compare(node[i * 2 + 1], node[i * 2 + 2]); }
  }
  T Compare(T &A, T &B) { return std::max(A, B); }
  void update(ll X, T val) {
    X += N - 1;
    node[X] = val;
    while (X > 0) {
      X = (X - 1) / 2;
      node[X] = Compare(node[X * 2 + 1], node[X * 2 + 2]);
    }
  }
  T Query(ll a, ll b, ll now, ll l, ll r) { //[a,b),[l,r)
    if (r < 0)
      r = N;
    if (r <= a || b <= l)
      return mem;
    if (a <= l && r <= b)
      return node[now];
    auto vl = Query(a, b, now * 2 + 1, l, (l + r) / 2),
         vr = Query(a, b, now * 2 + 2, (l + r) / 2, r);
    return Compare(vl, vr);
  }
};
struct Binary_indexed_tree {
  int N;
  vi bit;
  Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
  void add(int x, int a) {
    for (x; x <= N; x += (x & -x))
      bit[x] += a;
  }
  ll sum(int x) {
    ll ret = 0;
    for (x; x > 0; x -= (x & -x))
      ret += bit[x];
    return ret;
  }
  ll lower_bound(ll X) {
    if (sum(N) < X)
      return -1;
    ll ret = 0, memo = 1, sum = 0;
    while (memo * 2 <= N)
      memo *= 2;
    while (memo > 0) {
      if (memo + ret <= N && sum + bit[memo + ret] < X) {
        sum += bit[memo + ret];
        ret += memo;
      }
      memo /= 2;
    }
    return ret + 1;
  }
};
struct Union_Find {
  ll N;
  vi par;
  vi siz;
  Union_Find(int n) : N(n) {
    par.resize(N);
    siz.resize(N, 1);
    rep(i, 0, N) par[i] = i;
  }
  ll root(ll X) {
    if (par[X] == X)
      return X;
    return par[X] = root(par[X]);
  }
  bool same(ll X, ll Y) { return root(X) == root(Y); }
  void unite(ll X, ll Y) {
    X = root(X);
    Y = root(Y);
    if (X == Y)
      return;
    par[X] = Y;
    siz[Y] += siz[X];
    siz[X] = 0;
  }
  ll size(ll X) { return siz[root(X)]; }
};
long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
vi fac, finv, inv;
void COMinit() {
  fac.resize(MAX);
  finv.resize(MAX);
  inv.resize(MAX);
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
ll COM(ll n, ll r) {
  if (n < r || n < 0 || r < 0)
    return 0;
  return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    std::swap(a, b);
    u -= t * v;
    std::swap(u, v);
  }
  u %= m;
  if (u < 0)
    u += m;
  return u;
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  ll N, M, S;
  cin >> N >> M >> S;
  vector<vector<std::tuple<ll, ll, ll>>> edge(N);
  rep(i, 0, M) {
    ll U, V, A, B;
    cin >> U >> V >> A >> B;
    edge[U - 1].pb(std::make_tuple(V - 1, A, B));
    edge[V - 1].pb(std::make_tuple(U - 1, A, B));
  }
  vi C(N), D(N);
  rep(i, 0, N) cin >> C[i] >> D[i];
  constexpr ll max = 25000;
  S = std::min(S, max);
  vector<vii> dp(N, vii(N, vi(max + 1, INF)));
  prique<std::tuple<ll, ll, ll, ll>> que;
  ll m = S, c = 0;
  while (m <= max && c < 10) {
    que.push(std::make_tuple(c * D[0], m, 0, 0));
    dp[0][0][m] = c * D[0];
    m += C[0];
    c++;
  }
  while (!que.empty()) {
    ll time, money, from, X;
    std::tie(time, money, from, X) = que.top();
    que.pop();
    if (dp[X][from][money] < time)
      continue;
    rep(i, 0, edge[X].size()) {
      ll Y, silver, dist;
      std::tie(Y, silver, dist) = edge[X][i];
      silver = money - silver;
      dist += time;
      if (silver < 0) {
        ll memo = (abs(silver) + C[from] - 1) / C[from];
        dist += memo * D[from];
        silver += memo * C[from];
        silver = std::min(silver, max);
      }
      if (dp[Y][from][silver] > dist) {
        dp[Y][from][silver] = dist;
        que.push(std::make_tuple(dist, silver, from, Y));
      }
      silver += C[from];
      dist += D[from];
      if (silver < 0) {
        ll memo = (abs(silver) + C[from] - 1) / C[from];
        dist += memo * D[from];
        silver += memo * C[from];
        silver = std::min(silver, max);
      }
    }
    from = X;
    if (dp[X][from][money] > time) {
      dp[X][from][money] = time;
      que.push(std::make_tuple(time, money, from, X));
    }
  }
  rep(i, 1, N) {
    ll ans = INF;
    rep(j, 0, N) {
      REP(k, 0, max) {
        ll sum = dp[i][j][k];
        ans = std::min(ans, sum);
      }
    }
    cout << ans << endl;
  }
}