Problem p00449 (C++)

Buggy submission (status: Time Limit Exceeded):
/* {{{ Shinobu kawaii */
/*
  ______   __        _                  __
.' ____ \ [  |      (_)                [  |
| (___ \_| | |--.   __   _ .--.   .--.  | |.--.   __   _
 _.____`.  | .-. | [  | [ `.-. |/ .'`\ \| '/'`\ \[  | | |
| \____) | | | | |  | |  | | | || \__. ||  \__/ | | \_/ |,
 \______.'[___]|__][___][___||__]'.__.'[__;.__.'  '.__.'_/

*/
/* }}} */

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

// #define int long long
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

/* cpp template {{{ */

/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

/* debug */
#define debug(x)                                                               \
  cerr << x << " "                                                             \
       << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
          dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {
  return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
  int x;
  std::cin >> x;
  return x;
}
template <typename T> void print(T x) { std::cout << x << '\n'; }
template <typename T> void print(std::vector<T> &v, std::string s = " ") {
  REP(i, v.size()) {
    if (i != 0)
      std::cout << s;
    std::cout << v[i];
  }
  std::cout << '\n';
}

/* }}} */

void warshallfloyd(vvi &d, int n) {
  REP(k, n) REP(i, n) REP(j, n) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); }
}

signed main() {
  int n, k;
  while (n = in(), k = in(), n || k) {
    vvi d(n, vi(n, INF));
    REP(i, k) {
      bool a = in();
      if (a) {
        int b = in() - 1, c = in() - 1, cost = in();
        d[b][c] = min(d[b][c], cost);
        d[c][b] = min(d[c][b], cost);
        warshallfloyd(d, n);
      } else {
        int b = in() - 1, c = in() - 1;
        print(d[b][c] == INF ? -1 : d[b][c]);
      }
    }
  }

  return 0;
}

Fixed submission:
/* {{{ Shinobu kawaii */
/*
  ______   __        _                  __
.' ____ \ [  |      (_)                [  |
| (___ \_| | |--.   __   _ .--.   .--.  | |.--.   __   _
 _.____`.  | .-. | [  | [ `.-. |/ .'`\ \| '/'`\ \[  | | |
| \____) | | | | |  | |  | | | || \__. ||  \__/ | | \_/ |,
 \______.'[___]|__][___][___||__]'.__.'[__;.__.'  '.__.'_/

*/
/* }}} */

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

// #define int long long
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

/* cpp template {{{ */

/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

/* debug */
#define debug(x)                                                               \
  cerr << x << " "                                                             \
       << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
          dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {
  return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
  int x;
  std::cin >> x;
  return x;
}
template <typename T> void print(T x) { std::cout << x << '\n'; }
template <typename T> void print(std::vector<T> &v, std::string s = " ") {
  REP(i, v.size()) {
    if (i != 0)
      std::cout << s;
    std::cout << v[i];
  }
  std::cout << '\n';
}

/* }}} */

void warshallfloyd(vvi &d, int n) {
  REP(k, n) REP(i, n) REP(j, n) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); }
}

signed main() {
  int n, k;
  while (n = in(), k = in(), n || k) {
    vvi d(n, vi(n, INF));
    REP(i, k) {
      bool a = in();
      if (a) {
        int b = in() - 1, c = in() - 1, cost = in();
        if (d[b][c] <= cost)
          continue;
        d[b][c] = min(d[b][c], cost);
        d[c][b] = min(d[c][b], cost);
        warshallfloyd(d, n);
      } else {
        int b = in() - 1, c = in() - 1;
        print(d[b][c] == INF ? -1 : d[b][c]);
      }
    }
  }

  return 0;
}