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

#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\\t" << b << endl
#define p3(a, b, c) idp cout << a << "\\t" << b << "\\t" << c << endl
#define p4(a, b, c, d)                                                         \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << endl
#define p5(a, b, c, d, e)                                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << "\\t" << j << endl
#define foreach(it, v)                                                         \\
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \\
  idp {                                                                        \\
    rep(i, n) { cout << x[i] << " "; }                                         \\
    puts("");                                                                  \\
  }
#define dump2(x, n)                                                            \\
  idp {                                                                        \\
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \\
    puts("");                                                                  \\
  }
#define dumpi(x)                                                               \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << (*it) << " ";                                                    \\
    }                                                                          \\
    puts("");                                                                  \\
  }
#define dumpi2(x)                                                              \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \\
    }                                                                          \\
    puts("");                                                                  \\
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \\
  rep(i, h) {                                                                  \\
    rep(j, w) cout << a[i][j] << " ";                                          \\
    puts("");                                                                  \\
  }

typedef pair<li, li> PI;

li res[55];
li n, m, s;

vector<pair<li, PI>> edge[55];

li c[55];
li d[55];

li dp[55][5050];
bool visited[55][5050];

const li lim = 5000;

int main() {
  cin >> n >> m >> s;
  rep(i, m) {
    li u, v, a, b;
    cin >> u >> v >> a >> b;
    u--;
    v--;
    edge[u].pb({v, {a, b}});
    edge[v].pb({u, {a, b}});
  }

  rin {
    cin >> c[i] >> d[i];
    res[i] = INF;
    rep(j, 10051) { dp[i][j] = INF; }
  }
  s = min(s, lim);

  // {-そこまでの所要時間, {頂点, 残り銀貨数}}
  priority_queue<pair<li, PI>> pq;
  pq.push({0, {0, s}});

  li rr = 0;

  while (!pq.empty()) {
    li now_time = -pq.top().F;
    li now = pq.top().S.F;
    li now_coin = pq.top().S.S;
    pq.pop();
    if (dp[now][now_coin] < now_time || visited[now][now_coin]) {
      continue;
    }
    visited[now][now_coin] = true;
    // p3(now_time, now, now_coin);
    dp[now][now_coin] = now_time;
    if (res[now] == INF) {
      rr++;
    }
    res[now] = min(res[now], now_time);
    if (rr == n) {
      break;
    }
    // add
    li add_num = 1;
    while (1) {
      if (now_coin + add_num * c[now] > lim) {
        pq.push({-now_time - d[now] * add_num, {now, lim}});
        break;
      }
      if (dp[now][now_coin + add_num * c[now]] <= now_time + d[now] * add_num) {
        break;
      }
      dp[now][now_coin + add_num * c[now]] = now_time + d[now] * add_num;
      pq.push(
          {-now_time - d[now] * add_num, {now, now_coin + add_num * c[now]}});
      ++add_num;
    }
    for (auto &&pqr : edge[now]) {
      li next = pqr.F;
      li a = pqr.S.F;
      li b = pqr.S.S;
      if (now_coin < a) {
        continue;
      }
      if (dp[next][now_coin - a] <= now_time + b) {
        continue;
      }
      dp[next][now_coin - a] = now_time + b;
      pq.push({-now_time - b, {next, now_coin - a}});
    }
  }
  repp(i, 1, n) { cout << res[i] << endl; }

  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\\t" << b << endl
#define p3(a, b, c) idp cout << a << "\\t" << b << "\\t" << c << endl
#define p4(a, b, c, d)                                                         \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << endl
#define p5(a, b, c, d, e)                                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << "\\t" << j << endl
#define foreach(it, v)                                                         \\
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \\
  idp {                                                                        \\
    rep(i, n) { cout << x[i] << " "; }                                         \\
    puts("");                                                                  \\
  }
#define dump2(x, n)                                                            \\
  idp {                                                                        \\
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \\
    puts("");                                                                  \\
  }
#define dumpi(x)                                                               \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << (*it) << " ";                                                    \\
    }                                                                          \\
    puts("");                                                                  \\
  }
#define dumpi2(x)                                                              \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \\
    }                                                                          \\
    puts("");                                                                  \\
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \\
  rep(i, h) {                                                                  \\
    rep(j, w) cout << a[i][j] << " ";                                          \\
    puts("");                                                                  \\
  }

typedef pair<li, li> PI;

li res[55];
li n, m, s;

vector<pair<li, PI>> edge[55];

li c[55];
li d[55];

li dp[55][10051];

const li lim = 5000;

int main() {
  cin >> n >> m >> s;
  rep(i, m) {
    li u, v, a, b;
    cin >> u >> v >> a >> b;
    u--;
    v--;
    edge[u].pb({v, {a, b}});
    edge[v].pb({u, {a, b}});
  }

  rin {
    cin >> c[i] >> d[i];
    res[i] = INF;
    rep(j, 10051) { dp[i][j] = INF; }
  }
  s = min(s, lim);

  // {-そこまでの所要時間, {頂点, 残り銀貨数}}
  priority_queue<pair<li, PI>> pq;
  pq.push({0, {0, s}});

  li rr = 0;

  while (!pq.empty()) {
    li now_time = -pq.top().F;
    li now = pq.top().S.F;
    li now_coin = pq.top().S.S;
    pq.pop();
    if (dp[now][now_coin] <= now_time) {
      continue;
    }
    // p3(now_time, now, now_coin);
    dp[now][now_coin] = now_time;
    if (res[now] == INF) {
      rr++;
    }
    res[now] = min(res[now], now_time);
    if (rr == n) {
      break;
    }
    // add
    li add_num = 1;
    while (1) {
      if (now_coin + add_num * c[now] > lim) {
        pq.push({-now_time - d[now] * add_num, {now, lim}});
        break;
      }
      if (dp[now][now_coin + add_num * c[now]] <= now_time + d[now] * add_num) {
        break;
      }
      pq.push(
          {-now_time - d[now] * add_num, {now, now_coin + add_num * c[now]}});
      ++add_num;
    }
    for (auto &&pqr : edge[now]) {
      li next = pqr.F;
      li a = pqr.S.F;
      li b = pqr.S.S;
      if (now_coin < a) {
        continue;
      }
      if (dp[next][now_coin - a] <= now_time + b) {
        continue;
      }
      pq.push({-now_time - b, {next, now_coin - a}});
    }
  }
  repp(i, 1, n) { cout << res[i] << endl; }

  return 0;
}