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

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rp(i, c) rep(i, (int)c.size())
#define fr(i, c)                                                               \\
  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(u) (u).rbegin(), (u).rend()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector<T>>
#define init(a, b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int inf = 1 << 28;
const double INF = 1e10, EPS = 1e-9;

template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template <class T> void input(T &a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}
template <class T> void input(T *a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}

int in() {
  int t;
  cin >> t;
  return t;
}

int main() {
  int n, m;
  while (cin >> n >> m, (n && m)) {
    int d[2][100][100];
    for (int i = 0; i < 2; i++) {
      for (int j = 0; j < 100; j++) {
        for (int k = 0; k < 100; k++) {
          d[i][j][k] = inf;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      int a, b, cost, time;
      cin >> a >> b >> cost >> time;
      a--;
      b--;
      d[0][a][b] = cost;
      d[0][b][a] = cost;
      d[1][a][b] = time;
      d[1][b][a] = time;
    }
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < m; j++) {
        for (int k = 0; k < m; k++) {
          for (int o = 0; o < 2; o++) {
            d[o][j][k] = min(d[o][j][k], d[o][i][j] + d[o][i][k]);
          }
        }
      }
    }
    int k;
    cin >> k;
    for (int i = 0; i < k; i++) {
      int p, q, r;
      cin >> p >> q >> r;
      p--;
      q--;
      cout << d[r][p][q] << endl;
    }
  }
  return 0;
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rp(i, c) rep(i, (int)c.size())
#define fr(i, c)                                                               \\
  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(u) (u).rbegin(), (u).rend()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector<T>>
#define init(a, b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int inf = 1 << 28;
const double INF = 1e10, EPS = 1e-9;

template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template <class T> void input(T &a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}
template <class T> void input(T *a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}

int in() {
  int t;
  cin >> t;
  return t;
}

struct sta {
  vi edges;
  vi costs;
  vi times;
};

int main() {

  while (1) {
    int n, m, k;
    cin >> n >> m;
    if (n == 0 && m == 0)
      break;
    vector<sta> stations(m);

    rep(i, n) {
      int a, b, cost, time;
      cin >> a >> b >> cost >> time;
      a--;
      b--;
      stations[a].edges.pb(b);
      stations[a].costs.pb(cost);
      stations[a].times.pb(time);
      stations[b].edges.pb(a);
      stations[b].costs.pb(cost);
      stations[b].times.pb(time);
    }
    cin >> k;
    rep(i, k) {
      int s, g, q;
      cin >> s >> g >> q;
      s--;
      g--;
      if (!q) {
        priority_queue<pii> Q;
        vi cost(m, inf);
        cost[s] = 0;
        Q.push(mp(0, s));
        while (!Q.empty()) {
          pii f = Q.top();
          Q.pop();
          sta now = stations[f.second];
          if (cost[f.second] < f.first)
            continue;
          rp(i, now.edges) {
            int to = now.edges[i];
            int cos = now.costs[i];
            if (cost[to] > f.first + cos) {
              cost[to] = f.first + cos;
              Q.push(mp(cost[to], to));
            }
          }
        }
        cout << cost[g] << endl;
      } else {
        priority_queue<pii> Q;
        vi time(m, inf);
        time[s] = 0;
        Q.push(mp(0, s));
        while (!Q.empty()) {
          pii f = Q.top();
          Q.pop();
          sta now = stations[f.second];
          if (time[f.second] < f.first)
            continue;
          rp(i, now.edges) {
            int to = now.edges[i];
            int ti = now.times[i];
            if (time[to] > f.first + ti) {
              time[to] = f.first + ti;
              Q.push(mp(time[to], to));
            }
          }
        }
        cout << time[g] << endl;
      }
    }
  }
}