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

#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> vint;
typedef vector<char> vchar;

#define PI 3.141592653589793238462643383279
#define intinf 200000014
#define longinf 200000000000000014LL
#define mod 1000000007LL
#define rep(i, n) for (i = 0; i < n; ++i)
#define rep1(i, n) for (i = 1; i < n; ++i)
#define rep2d(i, j, n)                                                         \\
  for (i = 0; i < n; ++i)                                                      \\
    for (j = i + 1; j < n; ++j)
#define per(i, n) for (i = n - 1; i > -1; --i)
#define int(x)                                                                 \\
  int x;                                                                       \\
  scanf("%d", &x)
#define int2(x, y)                                                             \\
  int x, y;                                                                    \\
  scanf("%d%d", &x, &y)
#define int3(x, y, z)                                                          \\
  int x, y, z;                                                                 \\
  scanf("%d%d%d", &x, &y, &z)
#define sc(x) cin >> x
#define sc2(x, y) cin >> x >> y
#define sc3(x, y, z) cin >> x >> y >> z
#define scn(n, a) rep(i, n) cin >> a[i]
#define sc2n(n, a, b) rep(i, n) cin >> a[i] >> b[i]
#define pri(x) cout << x << "\\n"
#define pri2(x, y) cout << x << " " << y << "\\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\\n"
#define debugn(i, n, a) rep(i, n) cout << " --- " << a[i] << "\\n";
#define debugin(i, n, a) rep(i, n) printf(" --- %10d\\n", a[i])
#define debugi2n(i, n, a, b) rep(i, n) printf(" --- %10d %10d\\n", a[i], b[i])
#define debugiin(i, n, a)                                                      \\
  rep(i, n) printf(" --- %10d %10d\\n", a[i].first, a[i].second)
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\\n", x)

struct edge {
  int to, cost;
};

vector<edge> G[100000];

ll dijkstra(int v, int e, int r) {
  ll res;
  int i, j;
  ll d[v];
  rep(i, v) d[i] = longinf;
  d[r] = 0LL;
  priority_queue<ll_i, vector<ll_i>, greater<ll_i>> Q;
  Q.push(mp(0LL, r));
  for (; !Q.empty();) {
    ll_i now = Q.top();
    Q.pop();
    if (d[now.Y] < now.X)
      continue;
    rep(i, G[now.Y].size()) {
      edge tmp = G[now.Y][i];
      if (d[tmp.to] > d[now.Y] + tmp.cost) {
        d[tmp.to] = d[now.Y] + tmp.cost;
        Q.push(mp(d[tmp.to], tmp.to));
      }
    }
  }

  rep(i, v) {
    if (d[i] >= longinf)
      pri("INF");
    else
      pri(d[i]);
  }

  return 0;
}

signed main(void) {
  int i, j, tmp, tmp2;
  for (int testcase = 0;; testcase++) {
    int3(v, e, r);
    rep(i, e) {
      int3(s, t, d);
      G[s].pb((edge){t, d});
    }
    dijkstra(v, e, r);

    /*/

    //*/
    break;
  }
  return 0;
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> vint;
typedef vector<char> vchar;

#define PI 3.141592653589793238462643383279
#define intinf 200000014
#define longinf 200000000000000014LL
#define mod 1000000007LL
#define rep(i, n) for (i = 0; i < n; ++i)
#define rep1(i, n) for (i = 1; i < n; ++i)
#define rep2d(i, j, n)                                                         \\
  for (i = 0; i < n; ++i)                                                      \\
    for (j = i + 1; j < n; ++j)
#define per(i, n) for (i = n - 1; i > -1; --i)
#define int(x)                                                                 \\
  int x;                                                                       \\
  scanf("%d", &x)
#define int2(x, y)                                                             \\
  int x, y;                                                                    \\
  scanf("%d%d", &x, &y)
#define int3(x, y, z)                                                          \\
  int x, y, z;                                                                 \\
  scanf("%d%d%d", &x, &y, &z)
#define sc(x) cin >> x
#define sc2(x, y) cin >> x >> y
#define sc3(x, y, z) cin >> x >> y >> z
#define scn(n, a) rep(i, n) cin >> a[i]
#define sc2n(n, a, b) rep(i, n) cin >> a[i] >> b[i]
#define pri(x) cout << x << "\\n"
#define pri2(x, y) cout << x << " " << y << "\\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\\n"
#define debugn(i, n, a) rep(i, n) cout << " --- " << a[i] << "\\n";
#define debugin(i, n, a) rep(i, n) printf(" --- %10d\\n", a[i])
#define debugi2n(i, n, a, b) rep(i, n) printf(" --- %10d %10d\\n", a[i], b[i])
#define debugiin(i, n, a)                                                      \\
  rep(i, n) printf(" --- %10d %10d\\n", a[i].first, a[i].second)
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\\n", x)

struct edge {
  int to, cost;
};

vector<edge> G[100000];

ll dijkstra(int v, int e, int r) {
  ll res;
  int i, j;
  ll d[v];
  rep(i, v) d[i] = longinf;
  d[r] = 0LL;
  priority_queue<ll_i> Q;
  Q.push(mp(0LL, r));
  for (; !Q.empty();) {
    ll_i now = Q.top();
    Q.pop();
    if (d[now.Y] < now.X)
      continue;
    rep(i, G[now.Y].size()) {
      edge tmp = G[now.Y][i];
      if (d[tmp.to] > d[now.Y] + tmp.cost) {
        d[tmp.to] = d[now.Y] + tmp.cost;
        Q.push(mp(d[tmp.to], tmp.to));
      }
    }
  }

  rep(i, v) {
    if (d[i] >= longinf)
      pri("INF");
    else
      pri(d[i]);
  }

  return 0;
}

signed main(void) {
  int i, j, tmp, tmp2;
  for (int testcase = 0;; testcase++) {
    int3(v, e, r);
    rep(i, e) {
      int3(s, t, d);
      G[s].pb((edge){t, d});
    }
    dijkstra(v, e, r);

    /*/

    //*/
    break;
  }
  return 0;
}