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


// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

// conversion
//------------------------------------------
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();
}

// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }

// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<vector<PII>> VVPII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQPII;

// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};

// other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))

// clear memory
#define CLR(a) memset((a), 0, sizeof(a))

// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

int dijkstra(int from, int to, VVPII &nodes, int station_count) {
  VI dist(station_count, 10e7);
  dist[from] = 0;
  PQPII q;
  q.emplace(0, from);
  while (!q.empty()) {
    PII task = q.top();
    int cost = task.first;
    int station = task.second;
    q.pop();
    if (dist[station] < cost)
      continue;
    for (PII node : nodes[station]) {
      int to_cost = node.first;
      int to_station = node.second;
      if (to_cost + dist[station] < dist[to_station]) {
        dist[to_station] = to_cost + dist[station];
        q.emplace(dist[to_station], to_station);
      }
    }
  }
  return dist[to];
}

int main(int argc, char const *argv[]) {
  for (int n, m; cin >> n >> m, n | m;) {
    VVPII fs(m + 1), ts(m + 1);
    REP(i, n) {
      int from, to, f, t;
      cin >> from >> to >> f >> t;
      fs[from].PB(MP(f, to));
      ts[from].PB(MP(t, to));
      fs[to].PB(MP(f, from));
      ts[to].PB(MP(t, from));
    }
    int request;
    cin >> request;
    REP(i, request) {
      int from, to, type;
      cin >> from >> to >> type;
      int ans = dijkstra(from, to, (type ? ts : fs), m + 1);
      cout << ans << endl;
    }
  }

  return 0;
}

Error: WA

Fixed submission:


// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

// conversion
//------------------------------------------
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();
}

// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }

// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<vector<PII>> VVPII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQPII;

// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};

// other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))

// clear memory
#define CLR(a) memset((a), 0, sizeof(a))

// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

int dijkstra(int from, int to, VVPII &nodes, int station_count) {
  VI dist(station_count, 10e7);
  dist[from] = 0;
  PQPII q;
  q.emplace(0, from);
  while (!q.empty()) {
    PII task = q.top();
    int cost = task.first;
    int station = task.second;
    q.pop();
    if (dist[station] < cost)
      continue;
    for (PII node : nodes[station]) {
      int to_cost = node.first;
      int to_station = node.second;
      if (to_cost + dist[station] < dist[to_station]) {
        dist[to_station] = to_cost + dist[station];
        q.emplace(dist[to_station], to_station);
      }
    }
  }
  return dist[to];
}

int main(int argc, char const *argv[]) {
  for (int n, m; cin >> n >> m, n | m;) {
    VVPII fs(n), ts(n);
    REP(i, n) {
      int from, to, f, t;
      cin >> from >> to >> f >> t;
      fs[from].PB(MP(f, to));
      ts[from].PB(MP(t, to));
      fs[to].PB(MP(f, from));
      ts[to].PB(MP(t, from));
    }
    int request;
    cin >> request;
    REP(i, request) {
      int from, to, type;
      cin >> from >> to >> type;
      int ans = dijkstra(from, to, (type ? ts : fs), m);
      cout << ans << endl;
    }
  }

  return 0;
}