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

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define CLR(a) memset((a), 0, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

struct UnionFind {
  vector<int> v;
  UnionFind(int n) : v(n) {
    for (int i = 0; i < n; i++)
      v[i] = i;
  }
  int find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
  void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
  int n, fr, reizoko_n, road, start, goal;
  while (cin >> n >> fr >> reizoko_n >> road >> start >> goal, n) {
    set<int> reizoko;
    REP(i, reizoko_n) {
      int a;
      cin >> a;
      reizoko.insert(a);
    }
    vvi roadv(n, vi(n, -1));
    REP(i, road) {
      int x, y, t;
      cin >> x >> y >> t;
      roadv[x][y] = t;
      roadv[y][x] = t;
    }
    int clear = -1;
    vvi G(n, vi(101, 1e9));
    G[start][fr] = 0;
    priority_queue<pair<pii, int>> Q;
    Q.push({{0, fr}, start});
    while (!Q.empty()) {
      pair<pii, int> q = Q.top();
      Q.pop();
      q.first.first *= -1;
      if (q.second == goal) {
        clear = q.first.first;
        break;
      }
      REP(i, n)
      if (roadv[q.second][i] != -1 &&
          q.first.second - roadv[q.second][i] >= 0) {
        if (G[i][q.first.second - roadv[q.second][i]] >
            q.first.first + roadv[q.second][i]) {
          G[i][q.first.second - roadv[q.second][i]] =
              q.first.first + roadv[q.second][i];
          Q.push({{-q.first.first - roadv[q.second][i],
                   q.first.second - roadv[q.second][i]},
                  i});
          if (EXIST(reizoko, i))
            for (int j = 1; roadv[q.second][i],
                     q.first.second - roadv[q.second][i] + j <= fr;
                 j++) {
              if (G[i][q.first.second - roadv[q.second][i] + j] >
                  q.first.first + roadv[q.second][i] + j) {
                G[i][q.first.second - roadv[q.second][i] + j] =
                    q.first.first + roadv[q.second][i] + j;
                Q.push({{-q.first.first - roadv[q.second][i] - j,
                         q.first.second - roadv[q.second][i] + j},
                        i});
              }
            }
        }
      }
    }
    if (clear != -1)
      cout << clear << endl;
    else
      cout << "Help!" << endl;
  }
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define CLR(a) memset((a), 0, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

struct UnionFind {
  vector<int> v;
  UnionFind(int n) : v(n) {
    for (int i = 0; i < n; i++)
      v[i] = i;
  }
  int find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
  void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
  int n, fr, reizoko_n, road, start, goal;
  while (cin >> n >> fr >> reizoko_n >> road >> start >> goal, n) {
    set<int> reizoko;
    REP(i, reizoko_n) {
      int a;
      cin >> a;
      reizoko.insert(a);
    }
    vvi roadv(n, vi(n, -1));
    REP(i, road) {
      int x, y, t;
      cin >> x >> y >> t;
      roadv[x][y] = t;
      roadv[y][x] = t;
    }
    int clear = -1;
    vvi G(n, vi(101, 1e9));
    G[start][fr] = 0;
    priority_queue<pair<pii, int>> Q;
    Q.push({{0, fr}, start});
    while (!Q.empty()) {
      pair<pii, int> q = Q.top();
      Q.pop();
      if (q.second == goal) {
        clear = q.first.first;
      }
      REP(i, n)
      if (roadv[q.second][i] != -1 &&
          q.first.second - roadv[q.second][i] >= 0) {
        if (G[i][q.first.second - roadv[q.second][i]] >
            q.first.first + roadv[q.second][i]) {
          G[i][q.first.second - roadv[q.second][i]] =
              q.first.first + roadv[q.second][i];
          Q.push({{q.first.first + roadv[q.second][i],
                   q.first.second - roadv[q.second][i]},
                  i});
          if (EXIST(reizoko, i))
            for (int j = 1; roadv[q.second][i],
                     q.first.second - roadv[q.second][i] + j <= fr;
                 j++) {
              if (G[i][q.first.second - roadv[q.second][i] + j] >
                  q.first.first + roadv[q.second][i] + j) {
                G[i][q.first.second - roadv[q.second][i] + j] =
                    q.first.first + roadv[q.second][i] + j;
                Q.push({{q.first.first + roadv[q.second][i] + j,
                         q.first.second - roadv[q.second][i] + j},
                        i});
              }
            }
        }
      }
    }
    if (clear != -1)
      cout << clear << endl;
    else
      cout << "Help!" << endl;
  }
}