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

#pragma GCC optimize("Ofast")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./Lib/Timer.hpp"
#include "./Lib/debug.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
// #define int ll

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto &
/* macro func */
template <class T> inline void sort(T &t) { std::sort(ALL(t)); }
template <class T> inline void rsort(T &t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T> inline void unique(T &t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S> inline bool chmax(T &t, const S &s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmaxE(T &t, const S &s) {
  if (s >= t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmin(T &t, const S &s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline void BR() { std::cout << "\\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T> using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::tuple;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> {
public:
  size_t operator()(const std::pair<ll, ll> &x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
} // namespace std

/* input */
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = 2;

//=============================================================================================

auto dijkstra(ll n, const unordered_multimap<ll, pair<ll, PAIR>> &graph,
              const V<PAIR> &v, ll begin, ll s) {

  const ll silvMax = 50 * n + 1;
  // const ll silvMax = 3 * n + 1;
  chmin(s, silvMax - 1);
  VVL dp(n, VL(silvMax, 1e17));
  using TYPE = pair<ll, PAIR>;
  priority_queue<TYPE, vector<TYPE>, std::greater<TYPE>> q;
  REP(k, silvMax) {
    ll nxSilv = s + v[begin].first * k;
    ll nxTime = v[begin].second * k;
    chmin(nxSilv, silvMax - 1);
    dp[begin][nxSilv] = nxTime;
    q.emplace(nxTime, PAIR{begin, nxSilv});
    if (nxSilv >= silvMax) {
      break;
    }
  }

  VL minV(n, -1);

  while (!q.empty()) {
    ll from = q.top().second.first;
    ll silv = q.top().second.second;
    ll nowTime = q.top().first;
    q.pop();
    if (dp[from][silv] < nowTime) {
      continue;
    }
    if (silv <= minV[from]) {
      continue;
    }
    minV[from] = silv;

    auto range = graph.equal_range(from);
    REPI2(itr, range.first, range.second) {
      ll to = itr->second.first;
      ll needSilv = itr->second.second.first;
      ll needTime = itr->second.second.second;
      ll nxSilv = silv - needSilv;
      if (nxSilv < 0) {
        continue;
      }
      ll nxTime = nowTime + needTime;
      REP(k, silvMax) {
        ll nxTimeK = nxTime + v[to].second * k;
        ll nxSilvK = nxSilv + v[to].first * k;
        chmin(nxSilvK, silvMax - 1);
        if (nxTimeK < dp[to][nxSilvK]) {
          dp[to][nxSilvK] = nxTimeK;
          q.emplace(nxTimeK, PAIR{to, nxSilvK});
        } else {
          break;
        }
        if (nxSilvK >= silvMax) {
          break;
        }
      }
    }
    // dump(from, silv, dp);
  }
  return dp;
}

signed main() {
  ll n, m, s;
  cin >> n >> m >> s;

  unordered_multimap<ll, pair<ll, PAIR>> graph;
  REP(_, m) {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    --a;
    --b;
    graph.emplace(a, pair<ll, PAIR>(b, PAIR(c, d)));
    graph.emplace(b, pair<ll, PAIR>(a, PAIR(c, d)));
  }
  V<PAIR> v;
  v.reserve(n);
  REP(_, n) {
    ll a, b;
    cin >> a >> b;
    v.emplace_back(a, b);
  }

  auto minList = dijkstra(n, graph, v, 0, s);

  FOR(i, 1, n) { cout << *std::min_element(ALL(minList[i])) << endl; }
  // dump(minList);
}


Error: TLE

Fixed submission:

#pragma GCC optimize("Ofast")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./Lib/Timer.hpp"
#include "./Lib/debug.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
// #define int ll

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto &
/* macro func */
template <class T> inline void sort(T &t) { std::sort(ALL(t)); }
template <class T> inline void rsort(T &t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T> inline void unique(T &t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S> inline bool chmax(T &t, const S &s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmaxE(T &t, const S &s) {
  if (s >= t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmin(T &t, const S &s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline void BR() { std::cout << "\\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T> using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::tuple;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> {
public:
  size_t operator()(const std::pair<ll, ll> &x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
} // namespace std

/* input */
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = 2;

//=============================================================================================

auto dijkstra(ll n, const unordered_multimap<ll, pair<ll, PAIR>> &graph,
              const V<PAIR> &v, ll begin, ll s) {

  const ll silvMax = 50 * n + 1;
  // const ll silvMax = 3 * n + 1;
  chmin(s, silvMax - 1);
  VVL dp(n, VL(silvMax, 1e17));
  using TYPE = pair<ll, PAIR>;
  priority_queue<TYPE, vector<TYPE>, std::greater<TYPE>> q;
  REP(k, silvMax) {
    ll nxSilv = s + v[begin].first * k;
    ll nxTime = v[begin].second * k;
    chmin(nxSilv, silvMax - 1);
    dp[begin][nxSilv] = nxTime;
    q.emplace(nxTime, PAIR{begin, nxSilv});
    if (nxSilv >= silvMax) {
      break;
    }
  }
  while (!q.empty()) {
    ll from = q.top().second.first;
    ll silv = q.top().second.second;
    ll nowTime = q.top().first;
    q.pop();
    if (dp[from][silv] < nowTime) {
      continue;
    }

    auto range = graph.equal_range(from);
    REPI2(itr, range.first, range.second) {
      ll to = itr->second.first;
      ll needSilv = itr->second.second.first;
      ll needTime = itr->second.second.second;
      ll nxSilv = silv - needSilv;
      if (nxSilv < 0) {
        continue;
      }
      ll nxTime = nowTime + needTime;
      REP(k, silvMax) {
        ll nxTimeK = nxTime + v[to].second * k;
        ll nxSilvK = nxSilv + v[to].first * k;
        chmin(nxSilvK, silvMax - 1);
        if (nxTimeK < dp[to][nxSilvK]) {
          dp[to][nxSilvK] = nxTimeK;
          q.emplace(nxTimeK, PAIR{to, nxSilvK});
        }
        if (nxSilvK >= silvMax) {
          break;
        }
      }
    }
    // dump(from, silv, dp);
  }
  return dp;
}

signed main() {
  ll n, m, s;
  cin >> n >> m >> s;

  unordered_multimap<ll, pair<ll, PAIR>> graph;
  REP(_, m) {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    --a;
    --b;
    graph.emplace(a, pair<ll, PAIR>(b, PAIR(c, d)));
    graph.emplace(b, pair<ll, PAIR>(a, PAIR(c, d)));
  }
  V<PAIR> v;
  v.reserve(n);
  REP(_, n) {
    ll a, b;
    cin >> a >> b;
    v.emplace_back(a, b);
  }

  auto minList = dijkstra(n, graph, v, 0, s);

  FOR(i, 1, n) { cout << *std::min_element(ALL(minList[i])) << endl; }
  // dump(minList);
}