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

#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(t, i, c) for (t::iretator i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);

const int INF = INT_MAX / 10;

struct state {
  int s, c;
  state(int s, int c) : s(s), c(c){};
  bool operator<(const state other) const { return c > other.c; }
};

int main() {
  int n, m;
  while (cin >> n >> m, n) {
    int a, b, c, t;
    vector<vvi> data(2, vvi(m, vi(m, INF)));
    REP(i, n) {
      cin >> a >> b >> c >> t;
      data[0][a - 1][b - 1] = c;
      data[0][b - 1][a - 1] = c;
      data[1][a - 1][b - 1] = t;
      data[1][b - 1][a - 1] = t;
    }

    int k;
    cin >> k;
    REP(i, k) {
      int p, q, r;
      cin >> p >> q >> r;

      priority_queue<state> Q;
      Q.push(state(p - 1, 0));
      vi cost(n, INF);
      cost[p - 1] = 0;
      while (!Q.empty()) {
        state st = Q.top();
        Q.pop();
        if (st.s == q - 1) {
          cost[q - 1] = min(cost[q - 1], st.c);
          continue;
        }
        REP(j, m) {
          if (st.s != j && data[r][st.s][j] != INF) {
            int ncost = st.c + data[r][st.s][j];
            if (ncost < cost[j]) {
              cost[j] = ncost;
              Q.push(state(j, ncost));
            }
          }
        }
      }
      cout << cost[q - 1] << endl;
    }
  }

  return 0;
}

Error: MLE

Fixed submission:

#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(t, i, c) for (t::iretator i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);

const int INF = INT_MAX / 10;

struct state {
  int s, c;
  state(int s, int c) : s(s), c(c){};
  bool operator<(const state other) const { return c > other.c; }
};

int main() {
  int n, m;
  while (cin >> n >> m, n) {
    int a, b, c, t;
    vector<vvi> data(2, vvi(n, vi(n, INF)));
    REP(i, n) {
      cin >> a >> b >> c >> t;
      data[0][a - 1][b - 1] = c;
      data[0][b - 1][a - 1] = c;
      data[1][a - 1][b - 1] = t;
      data[1][b - 1][a - 1] = t;
    }

    int k;
    cin >> k;
    REP(i, k) {
      int p, q, r;
      cin >> p >> q >> r;

      priority_queue<state> Q;
      Q.push(state(p - 1, 0));
      vi cost(n, INF);
      cost[p - 1] = 0;
      while (!Q.empty()) {
        state st = Q.top();
        Q.pop();
        if (st.s == q - 1) {
          cost[q - 1] = min(cost[q - 1], st.c);
          continue;
        }
        REP(j, n) {
          if (st.s != j && data[r][st.s][j] != INF) {
            int ncost = st.c + data[r][st.s][j];
            if (ncost < cost[j]) {
              cost[j] = ncost;
              Q.push(state(j, ncost));
            }
          }
        }
      }
      cout << cost[q - 1] << endl;
    }
  }

  return 0;
}