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

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>

#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s)                                                                \\
  string s;                                                                    \\
  cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x)                                                               \\
  cout << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;

const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//

template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
template <class T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
  a += b;
  if (a > Mod)
    a %= Mod;
}

inline void IN(void) { return; }

template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void) {
  cout << "\\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
  cout << first << " ";
  OUT(rest...);
  return;
}

bool pairsort(pll pl, pll pr) {
  if (pl.first == pr.first)
    return pl.second > pr.second;
  return pl.first < pr.first;
}

int cntbit(ll a, int n, int j) {
  int res = 0;
  For(i, j, n) {
    if (a >> i & 1) {
      res++;
    }
  }
  return res;
}
vector<int> make_bit(int a) {
  vector<int> res;
  lpi(32) if (a & (1 << i)) res.pb(i);
  return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
  if (b > a)
    return GCD(b, a);
  if (a % b == 0)
    return b;
  else
    return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
  if (a % b == 0)
    return a / b;
  else
    return (a + b) / b;
}
int rounddown(int a, int b) {
  if (a % b == 0)
    return a / b;
  else {
    return (a - b) / b;
  }
}
ll pow(ll a, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1)
      res *= a;
    a *= a;
    n = n >> 1;
  }
  return res;
}
ll GetDiviserCount(ll N) // 約数の個数
{
  ll res = 1;
  For(i, 2, sqrt(N) + 1) {
    ll cnt = 0;
    while (N % i == 0) {
      cnt++;
      N /= i;
    }
    res *= (cnt + 1);
    if (N == 1)
      break;
  }
  if (N != 1)
    res *= 2;
  return res;
}
vll GetDivisor(ll N) // 約数列挙
{
  vll res;
  for (ll i = 1; i * i <= N; i++) {
    if (N % i == 0) {
      res.pb(i);
      if (i * i != N)
        res.pb(N / i);
    }
  }
  sort(All(res));
  return res;
}
//_____________________　following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;

int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
// int ans;
vvll dist(55, vll(2505, INFL));
vll C(55);
vll D(55);
bool visi[55][2505];
struct Edge {
  int to;
  ll time;
  ll cost;
  Edge(int to, ll cost, ll time) : to(to), time(time), cost(cost) {}
};
struct Node {
  int curr;
  ll money;
  ll di;
  Node(int curr, ll money, ll di) : curr(curr), money(money), di(di) {}
  bool operator<(const Node &a) const { return di > a.di; }
};
vector<Edge> G[55];
vector<ll> ans(55, INFL);
ll Amax;
void Dijkstra(int s, ll mo) {
  priority_queue<Node> qu;
  mem(visi, false);
  // dist[s][mo] = 0;
  // visi[s][mo] = 1;

  qu.push(Node(0, mo, 0));
  while (!qu.empty()) {
    auto cur = qu.top();
    qu.pop();
    int pos = cur.curr;
    ll shozi = cur.money;
    ll di = cur.di;
    // dump(di);
    // cout << pos << " " << shozi << " " << di << endl;
    if (visi[pos][shozi])
      continue;
    dist[pos][shozi] = di;
    // chmin(ans[pos],di);
    visi[pos][shozi] = true;
    // visi[cur][shozi] = 1;
    chmin(ans[pos], dist[pos][shozi]);
    qu.push(Node(pos, min(shozi + C[pos], 2503ll), di + D[pos]));
    for (Edge e : G[pos]) {
      // dump(e.to);
      if (shozi - e.cost < 0)
        continue;
      if (visi[e.to][shozi - e.cost])
        continue;
      // dist[e.to][shozi-e.cost] = di+e.time;
      qu.push(Node(e.to, shozi - e.cost, di + e.time));
    }
  }
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll s;
  IN(n, m, s);
  rep(_, m) {
    int u, v;
    ll a, b;
    IN(u, v, a, b);
    u--;
    v--;
    G[u].push_back(Edge(v, a, b));
    G[v].push_back(Edge(u, a, b));
  }

  s = min(s, 2500ll);
  // dump(Amax);
  rep(i, n) {
    ll c, d;
    IN(c, d);
    C[i] = c;
    D[i] = d;
  }
  Dijkstra(0, s);
  For(i, 1, n) { cout << ans[i] << endl; }
  // cout << ans << endl;
  // for(auto c : ans){cout << c << endl;}
  // cout << fixed << setprecision(15) << ans << endl;
  return 0;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>

#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s)                                                                \\
  string s;                                                                    \\
  cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x)                                                               \\
  cout << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;

const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//

template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
template <class T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
  a += b;
  if (a > Mod)
    a %= Mod;
}

inline void IN(void) { return; }

template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void) {
  cout << "\\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
  cout << first << " ";
  OUT(rest...);
  return;
}

bool pairsort(pll pl, pll pr) {
  if (pl.first == pr.first)
    return pl.second > pr.second;
  return pl.first < pr.first;
}

int cntbit(ll a, int n, int j) {
  int res = 0;
  For(i, j, n) {
    if (a >> i & 1) {
      res++;
    }
  }
  return res;
}
vector<int> make_bit(int a) {
  vector<int> res;
  lpi(32) if (a & (1 << i)) res.pb(i);
  return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
  if (b > a)
    return GCD(b, a);
  if (a % b == 0)
    return b;
  else
    return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
  if (a % b == 0)
    return a / b;
  else
    return (a + b) / b;
}
int rounddown(int a, int b) {
  if (a % b == 0)
    return a / b;
  else {
    return (a - b) / b;
  }
}
ll pow(ll a, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1)
      res *= a;
    a *= a;
    n = n >> 1;
  }
  return res;
}
ll GetDiviserCount(ll N) // 約数の個数
{
  ll res = 1;
  For(i, 2, sqrt(N) + 1) {
    ll cnt = 0;
    while (N % i == 0) {
      cnt++;
      N /= i;
    }
    res *= (cnt + 1);
    if (N == 1)
      break;
  }
  if (N != 1)
    res *= 2;
  return res;
}
vll GetDivisor(ll N) // 約数列挙
{
  vll res;
  for (ll i = 1; i * i <= N; i++) {
    if (N % i == 0) {
      res.pb(i);
      if (i * i != N)
        res.pb(N / i);
    }
  }
  sort(All(res));
  return res;
}
//_____________________　following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;

int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
// int ans;
vvll dist(55, vll(2501, INF));
vll C(55);
vll D(55);
bool visi[55][2505];
struct Edge {
  int to;
  ll time;
  ll cost;
  Edge(int to, ll cost, ll time) : to(to), time(time), cost(cost) {}
};
struct Node {
  int curr;
  ll money;
  ll di;
  Node(int curr, ll money, ll di) : curr(curr), money(money), di(di) {}
  bool operator<(const Node &a) const { return di > a.di; }
};
vector<Edge> G[50];
vector<pll> exchange(50); // 1 -> Ci枚, 2-> かかる時間
vector<ll> ans(55, INF);
ll Amax;
void Dijkstra(int s, ll mo) {
  priority_queue<Node> qu;
  mem(visi, false);
  // dist[s][mo] = 0;
  // visi[s][mo] = 1;

  qu.push(Node(0, mo, 0));
  while (!qu.empty()) {
    auto cur = qu.top();
    qu.pop();
    int pos = cur.curr;
    ll shozi = cur.money;
    ll di = cur.di;
    // dump(di);
    // cout << pos << " " << shozi << " " << di << endl;
    if (dist[pos][shozi] != INF)
      continue;
    dist[pos][shozi] = di;
    // chmin(ans[pos],di);
    visi[pos][shozi] = true;
    // visi[cur][shozi] = 1;
    chmin(ans[pos], dist[pos][shozi]);
    qu.push(Node(pos, min(shozi + C[pos], Amax), di + D[pos]));
    for (Edge e : G[pos]) {
      // dump(e.to);
      if (shozi - e.cost < 0)
        continue;
      if (visi[e.to][shozi - e.to])
        continue;
      // dist[e.to][shozi-e.cost] = di+e.time;
      qu.push(Node(e.to, shozi - e.cost, di + e.time));
    }
  }
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll s;
  IN(n, m, s);
  Amax = 0;
  rep(_, m) {
    int u, v;
    ll a, b;
    IN(u, v, a, b);
    chmax(Amax, a);
    u--;
    v--;
    G[u].push_back(Edge(v, a, b));
    G[v].push_back(Edge(u, a, b));
  }
  Amax *= (n);
  // dump(Amax);
  rep(i, n) {
    ll c, d;
    IN(c, d);
    C[i] = c;
    D[i] = d;
  }
  Dijkstra(0, s);
  For(i, 1, n) { cout << ans[i] << endl; }
  // cout << ans << endl;
  // for(auto c : ans){cout << c << endl;}
  // cout << fixed << setprecision(15) << ans << endl;
  return 0;
}