Problem p01366 (C++) — buggy submission, verdict: Memory Limit Exceeded

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

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x " = " << x << endl
#define print(x) cout << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX / 3
#define MAX_N 10000

struct state {
  int v, l, c;
};

bool operator<(const state &a, const state &b) {
  if (a.l != b.l)
    return a.l > b.l;
  return a.c > b.c;
}

int main() {
  cin.sync_with_stdio(false);
  int n, m;
  int cost[MAX_N];
  vector<state> r[MAX_N];
  while (cin >> n >> m, n | m) {
    fill(cost, cost + n, INF);
    fill(r, r + n, vector<state>());

    rep(i, m) {
      int u, v, l, c;
      cin >> u >> v >> l >> c;
      u--, v--;
      r[u].pb((state{v, l, c})), r[v].pb((state{u, l, c}));
    }

    priority_queue<state> q;
    q.push(state{0, 0, 0});
    while (!q.empty()) {
      state s = q.top();
      q.pop();

      if (cost[s.v] < INF)
        continue;
      else
        cost[s.v] = s.c;
      bool ok = true;
      rep(i, n) if (cost[i] == INF) ok = false;
      if (ok)
        break;

      rep(i, r[s.v].size()) {
        state tmp = r[s.v][i];
        if (tmp.c < cost[tmp.v]) {
          q.push(state{tmp.v, s.l + tmp.l, tmp.c});
        }
      }
    }

    int ans = 0;
    repl(i, 1, n) ans += cost[i];
    cout << ans << endl;
  }

  return 0;
}

Error: MLE

Fixed submission:

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

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x " = " << x << endl
#define print(x) cout << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX / 3
#define MAX_N 10000

struct state {
  int v, l, c;
};

bool operator<(const state &a, const state &b) {
  if (a.l != b.l)
    return a.l > b.l;
  return a.c > b.c;
}

int main() {
  cin.sync_with_stdio(false);
  int n, m;
  int cost[MAX_N];
  unordered_map<int, P> mp;
  while (cin >> n >> m, n | m) {
    rep(i, n) cost[i] = INF;
    mp.clear();

    rep(i, m) {
      int u, v, l, c;
      cin >> u >> v >> l >> c;
      u--, v--;
      if (u > v)
        swap(u, v);
      mp[u * MAX_N + v] = P(l, c);
      // mp[v * MAX_N + u] = P(l, c);
    }

    priority_queue<state> q;
    q.push(state{0, 0, 0});
    while (!q.empty()) {
      state s = q.top();
      q.pop();

      if (cost[s.v] < INF)
        continue;
      else
        cost[s.v] = s.c;
      bool ok = true;
      rep(i, n) if (cost[i] == INF) ok = false;
      if (ok)
        break;

      rep(i, n) {
        int mi = min(s.v, i), ma = max(s.v, i);
        if (mp[mi * MAX_N + ma].fi > 0 && cost[i] == INF) {
          q.push(
              state{i, s.l + mp[mi * MAX_N + ma].fi, mp[mi * MAX_N + ma].se});
        }
      }
    }

    int ans = 0;
    repl(i, 1, n) ans += cost[i];
    cout << ans << endl;
  }

  return 0;
}