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

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#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;

struct edge {
  int to, dist, attack;
};

struct P {
  int from, money, enemy;

  bool operator>(const P &p) const { return enemy > p.enemy; }
};

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

int N, M, L;

int main() {
  while (cin >> N >> M >> L, N | M | L) {
    vector<vector<edge>> E(N + 1);
    REP(i, M) {
      int from, to, dist, enemy;
      cin >> from >> to >> dist >> enemy;
      E[from].push_back((edge){to, dist, enemy});
      E[to].push_back((edge){from, dist, enemy});
    }

    bool G[N + 1][L + 1];
    fill_n((bool *)G, (N + 1) * (L + 1), false);

    priority_queue<P, vector<P>, greater<P>> q;
    // start
    q.push((P){1, L, 0});
    int enemy = 0;
    while (!q.empty()) {
      P p = q.top();
      q.pop();
      // goal
      if (p.from == N) {
        enemy = p.enemy;
        break;
      }
      if (G[p.from][p.money])
        continue;
      G[p.from][p.money] = true;
      for (edge e : E[p.from]) {
        if (p.money >= e.dist) {
          q.push((P){e.to, p.money - e.dist, p.enemy});
        }
        q.push((P){e.to, p.money, p.enemy + e.attack});
      }
    }

    cout << enemy << endl;
  }
}

Error: 0

Fixed submission:

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#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;

struct edge {
  int to, dist, attack;
};

struct P {
  int from, money, enemy;

  bool operator>(const P &p) const { return enemy > p.enemy; }
};

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

int N, M, L;

int main() {
  while (cin >> N >> M >> L, N | M | L) {
    vector<vector<edge>> E(N + 1);
    REP(i, M) {
      int from, to, dist, enemy;
      cin >> from >> to >> dist >> enemy;
      E[from].push_back((edge){to, dist, enemy});
      E[to].push_back((edge){from, dist, enemy});
    }

    // bool G[N+1][L+1];
    // fill_n((bool *)G, (N+1)*(L+1), false);

    priority_queue<P, vector<P>, greater<P>> q;
    // start
    q.push((P){1, L, 0});
    int enemy = 0;
    while (!q.empty()) {
      P p = q.top();
      q.pop();
      // goal
      if (p.from == N) {
        enemy = p.enemy;
        break;
      }
      // if (G[p.from][p.money]) continue;
      // G[p.from][p.money] = true;
      for (edge e : E[p.from]) {
        if (p.money >= e.dist) {
          q.push((P){e.to, p.money - e.dist, p.enemy});
        }
        q.push((P){e.to, p.money, p.enemy + e.attack});
      }
    }

    cout << enemy << endl;
  }
}