Problem p02703 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  int M;
  if (N > 0)
    M = A[0].size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
vector<int> dijkstra(graph &G, int s) {
  /// stat must have "<"&">"
  /// init d=vector<stat>
  vector<int> d(G.size(), LINF);
  d[s] = 0;
  // init q=p-queue<pair<stat,index> >
  priority_queue<pii, vector<pii>, greater<pii>> q;
  q.push(pii(0, s));

  while (!q.empty()) {
    pii p = q.top();
    q.pop();
    if (d[p.second] < p.first)
      continue;
    for (int i = 0; i < G[p.second].size(); i++) {
      edge e = G[p.second][i];
      if (p.first + e.d < d[e.to]) {
        d[e.to] = p.first + e.d;
        q.push(pii(d[e.to], e.to));
      }
    }
  }
  return d;
}
int N, M, K, T, Q, H, W;
signed main() {
  cin >> N;
  int S;
  cin >> M >> S;
  chmin(S, 2525);
  graph G(N);
  rep(i, M) {
    int U, V, A, B;
    cin >> U >> V >> A >> B;
    --U;
    --V;
    G[U].emplace_back(U, V, B, A);
    G[V].emplace_back(V, U, B, A);
  }
  vector<int> C(N), D(N);
  rep(i, N) cin >> C[i] >> D[i];
  vector<vector<int>> dp(N, vector<int>(2526, LINF));
  dp[0][S] = 0;
  priority_queue<pair<int, pii>, vector<pair<int, pii>>,
                 greater<pair<int, pii>>>
      q;
  q.push(pair<int, pii>(0, pii(0, S)));
  while (!q.empty()) {
    pair<int, pii> p = q.top();
    q.pop();
    int i = p.second.first;
    int s = p.second.second;
    int d = p.first;
    //	cout << i << " " << s << " " << d << endl;
    if (dp[i][s] < d)
      continue;
    int s2 = s;
    int d2 = d;
    while (1) {
      s2 += C[i];
      chmin(s2, 2525);
      // cout << s2;
      d2 += D[i];
      if (dp[i][s2] <= d2)
        break;
      dp[i][s2] = d2;
      q.push(make_pair(d2, pii(i, s2)));
      if (s2 == 2525)
        break;
    }
    for (edge &e : G[i]) {
      if (s - e.c >= 0) {
        if (d + e.d < dp[e.to][s - e.c]) {
          dp[e.to][s - e.c] = d + e.d;
          q.push(make_pair(d + e.d, pii(e.to, s - e.c)));
        }
      }
    }
  }
  vector<int> ans(N, LINF);
  rep(i, N) {
    if (i == 0)
      continue;
    rep(j, dp[i].size()) { chmin(ans[i], dp[i][j]); }
  }
  rep(i, N) {
    if (i) {
      cout << ans[i] << endl;
    }
  }
  return 0;
}

Error: -6
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc


Fixed submission:

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  int M;
  if (N > 0)
    M = A[0].size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
vector<int> dijkstra(graph &G, int s) {
  /// stat must have "<"&">"
  /// init d=vector<stat>
  vector<int> d(G.size(), LINF);
  d[s] = 0;
  // init q=p-queue<pair<stat,index> >
  priority_queue<pii, vector<pii>, greater<pii>> q;
  q.push(pii(0, s));

  while (!q.empty()) {
    pii p = q.top();
    q.pop();
    if (d[p.second] < p.first)
      continue;
    for (int i = 0; i < G[p.second].size(); i++) {
      edge e = G[p.second][i];
      if (p.first + e.d < d[e.to]) {
        d[e.to] = p.first + e.d;
        q.push(pii(d[e.to], e.to));
      }
    }
  }
  return d;
}
int N, M, K, T, Q, H, W;
signed main() {
  cin >> N;
  int S;
  cin >> M >> S;
  graph G(N);
  rep(i, M) {
    int U, V, A, B;
    cin >> U >> V >> A >> B;
    --U;
    --V;
    G[U].emplace_back(U, V, B, A);
    G[V].emplace_back(V, U, B, A);
  }
  vector<int> C(N), D(N);
  rep(i, N) cin >> C[i] >> D[i];
  vector<vector<int>> dp(N, vector<int>(2526, LINF));
  dp[0][S] = 0;
  priority_queue<pair<int, pii>, vector<pair<int, pii>>,
                 greater<pair<int, pii>>>
      q;
  q.push(pair<int, pii>(0, pii(0, S)));
  while (!q.empty()) {
    pair<int, pii> p = q.top();
    q.pop();
    int i = p.second.first;
    int s = p.second.second;
    int d = p.first;
    //	cout << i << " " << s << " " << d << endl;
    if (dp[i][s] < d)
      continue;
    int s2 = s;
    int d2 = d;
    while (1) {
      s2 += C[i];
      chmin(s2, 2525);
      // cout << s2;
      d2 += D[i];
      if (dp[i][s2] <= d2)
        break;
      dp[i][s2] = d2;
      q.push(make_pair(d2, pii(i, s2)));
      if (s2 == 2525)
        break;
    }
    for (edge &e : G[i]) {
      if (s - e.c >= 0) {
        if (d + e.d < dp[e.to][s - e.c]) {
          dp[e.to][s - e.c] = d + e.d;
          q.push(make_pair(d + e.d, pii(e.to, s - e.c)));
        }
      }
    }
  }
  vector<int> ans(N, LINF);
  rep(i, N) {
    if (i == 0)
      continue;
    rep(j, dp[i].size()) { chmin(ans[i], dp[i][j]); }
  }
  rep(i, N) {
    if (i) {
      cout << ans[i] << endl;
    }
  }
  return 0;
}