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

// #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
          Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ダイクストラ
// LINFにしてあるよ
struct edge {
  ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
  ll V;
  vector<vector<edge>> G;
  vector<ll> d;
  // vector<ll> count;経路の本数
  // vector<ll> prev; // prev[v] := v から復元できる辺たち
  graph(ll n) { init(n); }

  void init(ll n) {
    V = n;
    G.resize(V);
    d.resize(V);
    // count.resize(V);
    rep(i, V) {
      d[i] = LINF;
      // count[i] = 0;
    }
  }

  void add_edge(ll s, ll t, ll cost) {
    edge e;
    e.to = t, e.cost = cost;
    G[s].push_back(e);
  }

  void dijkstra(ll s) {
    rep(i, V) {
      d[i] = LINF;
      // count[i] = 0;
    }
    d[s] = 0;
    // count[s] = 1;
    priority_queue<P, vector<P>, greater<P>> que;
    que.push(P(0, s));
    while (!que.empty()) {
      P p = que.top();
      que.pop();
      ll v = p.second;
      if (d[v] < p.first)
        continue;
      for (auto e : G[v]) {
        if (d[e.to] > d[v] + e.cost) {
          d[e.to] = d[v] + e.cost;
          que.push(P(d[e.to], e.to));
          // count[e.to] = count[v];
          //  復元のための
          // prev[e.to]=v;
        }
        /*
else if (d[e.to] == d[v] + e.cost)
        {
            count[e.to] += count[v];
            count[e.to] %= MOD;
        }
        */
      }
    }
  }
};
ll n, m, s;
vector<ll> u, v, a, b, c, d;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> s;
  s = min(s, ll(2900));
  u.resize(m);
  v.resize(m);
  a.resize(m);
  b.resize(m);
  c.resize(n);
  d.resize(n);
  graph g(n * 3001);
  rep(i, m) {
    cin >> u[i] >> v[i] >> a[i] >> b[i];
    u[i]--;
    v[i]--;
    rep(j, 3000 - a[i]) {
      g.add_edge(u[i] + n * (j + a[i]), v[i] + j * n, b[i]);
      g.add_edge(v[i] + n * (j + a[i]), u[i] + j * n, b[i]);
    }
  }
  rep(i, n) {
    cin >> c[i] >> d[i];
    rep(j, 3000) {
      g.add_edge(ll(i) + j * n, ll(i) + min(c[i] + j, ll(3000)) * n, d[i]);
    }
  }
  g.dijkstra(0 + s * n);
  for (int i = 1; i < n; i++) {
    ll ans = LINF;
    rep(j, 3000) { chmin(ans, g.d[i + n * j]); }
    cout << ans << "\\n";
  }
}


Error: 0

Fixed submission:

// #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
          Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ダイクストラ
// LINFにしてあるよ
struct edge {
  ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
  ll V;
  vector<vector<edge>> G;
  vector<ll> d;
  // vector<ll> count;経路の本数
  // vector<ll> prev; // prev[v] := v から復元できる辺たち
  graph(ll n) { init(n); }

  void init(ll n) {
    V = n;
    G.resize(V);
    d.resize(V);
    // count.resize(V);
    rep(i, V) {
      d[i] = LINF;
      // count[i] = 0;
    }
  }

  void add_edge(ll s, ll t, ll cost) {
    edge e;
    e.to = t, e.cost = cost;
    G[s].push_back(e);
  }

  void dijkstra(ll s) {
    rep(i, V) {
      d[i] = LINF;
      // count[i] = 0;
    }
    d[s] = 0;
    // count[s] = 1;
    priority_queue<P, vector<P>, greater<P>> que;
    que.push(P(0, s));
    while (!que.empty()) {
      P p = que.top();
      que.pop();
      ll v = p.second;
      if (d[v] < p.first)
        continue;
      for (auto e : G[v]) {
        if (d[e.to] > d[v] + e.cost) {
          d[e.to] = d[v] + e.cost;
          que.push(P(d[e.to], e.to));
          // count[e.to] = count[v];
          //  復元のための
          // prev[e.to]=v;
        }
        /*
else if (d[e.to] == d[v] + e.cost)
        {
            count[e.to] += count[v];
            count[e.to] %= MOD;
        }
        */
      }
    }
  }
};
ll n, m, s;
vector<ll> u, v, a, b, c, d;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> s;
  u.resize(m);
  v.resize(m);
  a.resize(m);
  b.resize(m);
  c.resize(n);
  d.resize(n);
  graph g(n * 3001);
  rep(i, m) {
    cin >> u[i] >> v[i] >> a[i] >> b[i];
    u[i]--;
    v[i]--;
    rep(j, 3000 - a[i]) {
      g.add_edge(u[i] + n * (j + a[i]), v[i] + j * n, b[i]);
      g.add_edge(v[i] + n * (j + a[i]), u[i] + j * n, b[i]);
    }
  }
  rep(i, n) {
    cin >> c[i] >> d[i];
    rep(j, 3000) {
      g.add_edge(ll(i) + j * n, ll(i) + min(c[i] + j, ll(3000)) * n, d[i]);
    }
  }
  g.dijkstra(0 + s * n);
  for (int i = 1; i < n; i++) {
    ll ans = LINF;
    rep(j, 3000) { chmin(ans, g.d[i + n * j]); }
    cout << ans << "\\n";
  }
}