Problem p02892 (C++)

Buggy submission (status: Time Limit Exceeded):
#ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif

#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using PII = pair<int, int>;
template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1e9 + 7;
const ll INF_LL = (ll)1e18 + 7;

#define __overload3(_1, _2, _3, name, ...) name
#define rep(...)                                                               \
  __overload3(__VA_ARGS__, repFromUntil, repUntil, repeat)(__VA_ARGS__)
#define repeat(times) repFromUntil(__name##__LINE__, 0, times)
#define repUntil(name, times) repFromUntil(name, 0, times)
#define repFromUntil(name, from, until)                                        \
  for (int name = from, name##__until = (until); name < name##__until; name++)
#define repr(...)                                                              \
  __overload3(__VA_ARGS__, reprFromUntil, reprUntil, repeat)(__VA_ARGS__)
#define reprUntil(name, times) reprFromUntil(name, 0, times)
#define reprFromUntil(name, from, until)                                       \
  for (int name = until - 1, name##__from = (from); name >= name##__from;      \
       name--)

#define EXIT(out)                                                              \
  do {                                                                         \
    OUT(out);                                                                  \
    exit(0);                                                                   \
  } while (0)

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define _1 first
#define _2 second

#define debug(v)                                                               \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #v << " > ";                          \
    debugos << (v) << newl;                                                    \
  } while (0)
#define debugv(v)                                                              \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #v << " > ";                          \
    for (auto e : (v)) {                                                       \
      debugos << e << " ";                                                     \
    }                                                                          \
    debugos << newl;                                                           \
  } while (0)
#define debuga(m, w)                                                           \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #m << " > ";                          \
    for (int x = 0; x < (w); x++) {                                            \
      debugos << (m)[x] << " ";                                                \
    }                                                                          \
    debugos << newl;                                                           \
  } while (0)
#define debugaa(m, h, w)                                                       \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #m << " > \n";                        \
    for (int y = 0; y < (h); y++) {                                            \
      for (int x = 0; x < (w); x++) {                                          \
        debugos << (m)[y][x] << " ";                                           \
      }                                                                        \
      debugos << newl;                                                         \
    }                                                                          \
  } while (0)

#define newl "\n"
constexpr int dr[] = {1, -1, 0, 0}; // LRUD
constexpr int dc[] = {0, 0, 1, -1};

bool inside(int r, int c, int H, int W) {
  return 0 <= r and r < H and 0 <= c and c < W;
}

template <typename T> bool chmin(T &var, T x) {
  if (var > x) {
    var = x;
    return true;
  } else
    return false;
}

template <typename T> bool chmax(T &var, T x) {
  if (var < x) {
    var = x;
    return true;
  } else
    return false;
}

template <typename T> int sgn(T val) { return (T(0) < val) - (val < T(0)); }

ll power(ll e, int t, ll mod = INF_LL) {
  ll res = 1;
  while (t) {
    if (t & 1)
      res = (res * e) % mod;
    t >>= 1;
    e = (e * e) % mod;
  }
  return res;
}

template <typename T> T divceil(T, T);

template <typename T> T divfloor(T m, T d) {
  if (sgn(m) * sgn(d) >= 0)
    return m / d;
  else
    return -divceil(abs(m), abs(d));
}

template <typename T> T divceil(T m, T d) {
  if (m >= 0 and d > 0)
    return (m + d - 1) / d;
  else if (m < 0 and d < 0)
    return divceil(-m, -d);
  else
    return -divfloor(abs(m), abs(d));
}

template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}

template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

string operator*(const string &s, int times) {
  string res = "";
  rep(times) res += s;
  return res;
}

class MyScanner {
public:
  int offset = 0;
  template <typename T> void input_integer(T &var) {
    var = 0;
    T sign = 1;
    int cc = getchar();
    for (; cc < '0' || '9' < cc; cc = getchar())
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
    var += offset;
  }
  int c() {
    char c;
    while (c = getchar(), c == ' ' or c == '\n')
      ;
    return c;
  }
  MyScanner &operator>>(char &var) {
    var = c();
    return *this;
  }
  MyScanner &operator>>(int &var) {
    input_integer<int>(var);
    return *this;
  }
  MyScanner &operator>>(ll &var) {
    input_integer<ll>(var);
    return *this;
  }
  MyScanner &operator>>(string &var) {
    var = "";
    int cc = getchar();
    for (; !isvisiblechar(cc); cc = getchar())
      ;
    for (; isvisiblechar(cc); cc = getchar())
      var.push_back(cc);
    return *this;
  }
  template <typename T> operator T() {
    T x;
    *this >> x;
    return x;
  }
  template <typename T> void operator()(T &t) { *this >> t; }
  template <typename T, typename... Ts> void operator()(T &t, Ts &...ts) {
    *this >> t;
    this->operator()(ts...);
  }
  template <typename Iter> void iter(Iter first, Iter last) {
    while (first != last)
      *this >> *first, first++;
  }
  VI vi(int n) {
    VI res(n);
    iter(all(res));
    return res;
  }
  VVI vvi(int n, int m) {
    VVI res(n);
    rep(i, n) res[i] = vi(m);
    return res;
  }
  VLL vll(int n) {
    VLL res(n);
    iter(all(res));
    return res;
  }
  VVLL vvll(int n, int m) {
    VVLL res(n);
    rep(i, n) res[i] = vll(m);
    return res;
  }
  template <typename T> vector<T> v(int n) {
    vector<T> res(n);
    iter(all(res));
    return res;
  }

private:
  int isvisiblechar(int c) { return 0x21 <= c && c <= 0x7E; }
} IN, IN1{-1};

class MyPrinter {
public:
  template <typename T> void output_integer(T var) {
    if (var == 0) {
      putchar('0');
      return;
    }
    if (var < 0)
      putchar('-'), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p)
      putchar(stack[--stack_p]);
  }
  MyPrinter &operator<<(char c) {
    putchar(c);
    return *this;
  }
  MyPrinter &operator<<(double x) {
    printf("%.10f\n", x);
    return *this;
  }
  template <typename T> MyPrinter &operator<<(T var) {
    output_integer<T>(var);
    return *this;
  }
  MyPrinter &operator<<(char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const string &str) {
    const char *p = str.c_str();
    const char *l = p + str.size();
    while (p < l)
      putchar(*p++);
    return *this;
  }
  template <typename T> void operator()(T x) { *this << x << newl; }
  template <typename T, typename... Ts> void operator()(T x, Ts... xs) {
    *this << x << " ";
    this->operator()(xs...);
  }
  template <typename Iter> void iter(Iter s, Iter t) {
    if (s == t)
      *this << "\n";
    else {
      for (; s != t; s++) {
        *this << *s << " \n"[next(s, 1) == t];
      }
    }
  }
  template <typename Range> void range(const Range &r) {
    iter(begin(r), end(r));
  }
} OUT;

class DebugPrint {
public:
  template <typename T> DebugPrint &operator<<(const T &v) {
#ifdef LOCAL
    cerr << v;
#endif
    return *this;
  }
} debugos;

#pragma GCC diagnostic ignored "-Wshadow"
template <typename T, typename Cmb, typename Upd> struct segtree {
  const int n;
  const T unit;
  const Cmb cmb;
  const Upd upd;
  vector<T> data;
  segtree(int n = 0, T unit = T(), Cmb cmb = Cmb(), Upd upd = Upd())
      : n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1, unit) {
    build();
  }
  template <typename Iter>
  segtree(Iter first, Iter last, int n, T unit = T(), Cmb cmb = Cmb(),
          Upd upd = Upd())
      : n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1) {
    assign(first, last);
  }
  void build() { repr(i, n) data[i] = cmb(data[i << 1], data[i << 1 | 1]); }
  template <typename Iter> void assign(Iter first, Iter last) {
    copy(first, last, data.begin() + n);
    build();
  }
  void modify(int l, T v) {
    l += n;
    data[l] = upd(data[l], v);
    for (; l > 1; l >>= 1)
      data[l >> 1] = cmb(data[l & (~1)], data[l | 1]);
  }
  T query(int l, int r) {
    if (l == r)
      return unit;
    if (l + 1 == r)
      return data[l + n];
    T resl = data[l += n], resr = data[(r += n) - 1];
    for (l++, r--; l < r; l >>= 1, r >>= 1) {
      if (l & 1)
        resl = cmb(resl, data[l++]);
      if (r & 1)
        resr = cmb(data[--r], resr);
    }
    return cmb(resl, resr);
  }
};
#pragma GCC diagnostic warning "-Wshadow"

template <typename T> struct minT {
  T operator()(T a, T b) const { return min(a, b); }
};

template <typename T> struct maxT {
  T operator()(T a, T b) const { return max(a, b); }
};

template <typename T> struct assign {
  T operator()(T a, T b) const { return b; }
};

template <typename T, typename Upd = assign<T>>
using RangeMin = segtree<T, minT<T>, Upd>;

template <typename T, typename Upd = assign<T>>
using RangeMax = segtree<T, maxT<T>, maxT<T>>;

template <typename T, typename U>
ostream &operator<<(ostream &out, pair<T, U> var) {
  return out << var.first << " " << var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
ostream &tuple_impl(ostream &out, Tuple var) {
  return out;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
ostream &tuple_impl(ostream &out, Tuple var) {
  out << get<I>(var) << " ";
  return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename... Ts> ostream &operator<<(ostream &out, tuple<Ts...> var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename T, typename U>
MyPrinter &operator<<(MyPrinter &out, pair<T, U> var) {
  return out << var.first << " " << var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, Tuple var) {
  return out;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, Tuple var) {
  out << get<I>(var) << " ";
  return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename... Ts>
MyPrinter &operator<<(MyPrinter &out, tuple<Ts...> var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename T, typename U>
MyScanner &operator>>(MyScanner &in, pair<T, U> &var) {
  return in >> var.first >> var.second;
}
template <typename... Ts>
MyScanner &operator>>(MyScanner &in, tuple<Ts...> &var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(in, var);
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  return in;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  in >> get<I>(var);
  return tuple_impl<Tuple, I + 1, N>(in, var);
}

#pragma GCC diagnostic ignored "-Wshadow"
struct union_find {
  int n;
  vector<int> par, rank, sz;
  union_find(int n) : n(n), par(n), rank(n), sz(n) {
    iota(all(par), 0);
    fill(all(sz), 1);
  }
  int root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }
  void merge(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y)
      return;
    if (rank[x] < rank[y])
      swap(x, y);
    par[y] = x;
    if (rank[x] == rank[y])
      rank[x]++;
    sz[x] += sz[y];
  }
  bool same(int x, int y) { return root(x) == root(y); }
  int size(int x) { return sz[root(x)]; }
};
#pragma GCC diagnostic warning "-Wshadow"

int main() {
  int n = IN;
  auto S = IN.v<string>(n);

  VI dist(n), par(n);
  VB done(n);
  stack<int> s;
  s.push(0);
  dist[0] = 0;
  par[0] = -1;
  done[0] = true;
  while (not s.empty()) {
    int v = s.top();
    s.pop();
    rep(next, n) if (S[v][next] == '1' and next != par[v]) {
      if (done[next]) {
        if (dist[v] % 2 == dist[next] % 2)
          EXIT(-1);
        continue;
      }
      dist[next] = dist[v] + 1;
      par[next] = v;
      s.push(next);
    }
  }

  auto d = make_v(n, n, INF);
  rep(i, n) d[i][i] = 0;
  rep(i, n) rep(j, n) if (S[i][j] == '1') d[i][j] = 1;
  rep(k, n) rep(i, n) rep(j, n) chmin(d[i][j], d[i][k] + d[k][j]);

  int D = 0;
  rep(i, n) rep(j, n) chmax(D, d[i][j]);
  OUT(D + 1);
}

Fixed submission:
#ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif

#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>

using namespace std;

using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using PII = pair<int, int>;
template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1e9 + 7;
const ll INF_LL = (ll)1e18 + 7;

#define __overload3(_1, _2, _3, name, ...) name
#define rep(...)                                                               \
  __overload3(__VA_ARGS__, repFromUntil, repUntil, repeat)(__VA_ARGS__)
#define repeat(times) repFromUntil(__name##__LINE__, 0, times)
#define repUntil(name, times) repFromUntil(name, 0, times)
#define repFromUntil(name, from, until)                                        \
  for (int name = from, name##__until = (until); name < name##__until; name++)
#define repr(...)                                                              \
  __overload3(__VA_ARGS__, reprFromUntil, reprUntil, repeat)(__VA_ARGS__)
#define reprUntil(name, times) reprFromUntil(name, 0, times)
#define reprFromUntil(name, from, until)                                       \
  for (int name = until - 1, name##__from = (from); name >= name##__from;      \
       name--)

#define EXIT(out)                                                              \
  do {                                                                         \
    OUT(out);                                                                  \
    exit(0);                                                                   \
  } while (0)

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define _1 first
#define _2 second

#define debug(v)                                                               \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #v << " > ";                          \
    debugos << (v) << newl;                                                    \
  } while (0)
#define debugv(v)                                                              \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #v << " > ";                          \
    for (auto e : (v)) {                                                       \
      debugos << e << " ";                                                     \
    }                                                                          \
    debugos << newl;                                                           \
  } while (0)
#define debuga(m, w)                                                           \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #m << " > ";                          \
    for (int x = 0; x < (w); x++) {                                            \
      debugos << (m)[x] << " ";                                                \
    }                                                                          \
    debugos << newl;                                                           \
  } while (0)
#define debugaa(m, h, w)                                                       \
  do {                                                                         \
    debugos << "L" << __LINE__ << " " << #m << " > \n";                        \
    for (int y = 0; y < (h); y++) {                                            \
      for (int x = 0; x < (w); x++) {                                          \
        debugos << (m)[y][x] << " ";                                           \
      }                                                                        \
      debugos << newl;                                                         \
    }                                                                          \
  } while (0)

#define newl "\n"
constexpr int dr[] = {1, -1, 0, 0}; // LRUD
constexpr int dc[] = {0, 0, 1, -1};

bool inside(int r, int c, int H, int W) {
  return 0 <= r and r < H and 0 <= c and c < W;
}

template <typename T> bool chmin(T &var, T x) {
  if (var > x) {
    var = x;
    return true;
  } else
    return false;
}

template <typename T> bool chmax(T &var, T x) {
  if (var < x) {
    var = x;
    return true;
  } else
    return false;
}

template <typename T> int sgn(T val) { return (T(0) < val) - (val < T(0)); }

ll power(ll e, int t, ll mod = INF_LL) {
  ll res = 1;
  while (t) {
    if (t & 1)
      res = (res * e) % mod;
    t >>= 1;
    e = (e * e) % mod;
  }
  return res;
}

template <typename T> T divceil(T, T);

template <typename T> T divfloor(T m, T d) {
  if (sgn(m) * sgn(d) >= 0)
    return m / d;
  else
    return -divceil(abs(m), abs(d));
}

template <typename T> T divceil(T m, T d) {
  if (m >= 0 and d > 0)
    return (m + d - 1) / d;
  else if (m < 0 and d < 0)
    return divceil(-m, -d);
  else
    return -divfloor(abs(m), abs(d));
}

template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}

template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

string operator*(const string &s, int times) {
  string res = "";
  rep(times) res += s;
  return res;
}

class MyScanner {
public:
  int offset = 0;
  template <typename T> void input_integer(T &var) {
    var = 0;
    T sign = 1;
    int cc = getchar();
    for (; cc < '0' || '9' < cc; cc = getchar())
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
    var += offset;
  }
  int c() {
    char c;
    while (c = getchar(), c == ' ' or c == '\n')
      ;
    return c;
  }
  MyScanner &operator>>(char &var) {
    var = c();
    return *this;
  }
  MyScanner &operator>>(int &var) {
    input_integer<int>(var);
    return *this;
  }
  MyScanner &operator>>(ll &var) {
    input_integer<ll>(var);
    return *this;
  }
  MyScanner &operator>>(string &var) {
    var = "";
    int cc = getchar();
    for (; !isvisiblechar(cc); cc = getchar())
      ;
    for (; isvisiblechar(cc); cc = getchar())
      var.push_back(cc);
    return *this;
  }
  template <typename T> operator T() {
    T x;
    *this >> x;
    return x;
  }
  template <typename T> void operator()(T &t) { *this >> t; }
  template <typename T, typename... Ts> void operator()(T &t, Ts &...ts) {
    *this >> t;
    this->operator()(ts...);
  }
  template <typename Iter> void iter(Iter first, Iter last) {
    while (first != last)
      *this >> *first, first++;
  }
  VI vi(int n) {
    VI res(n);
    iter(all(res));
    return res;
  }
  VVI vvi(int n, int m) {
    VVI res(n);
    rep(i, n) res[i] = vi(m);
    return res;
  }
  VLL vll(int n) {
    VLL res(n);
    iter(all(res));
    return res;
  }
  VVLL vvll(int n, int m) {
    VVLL res(n);
    rep(i, n) res[i] = vll(m);
    return res;
  }
  template <typename T> vector<T> v(int n) {
    vector<T> res(n);
    iter(all(res));
    return res;
  }

private:
  int isvisiblechar(int c) { return 0x21 <= c && c <= 0x7E; }
} IN, IN1{-1};

class MyPrinter {
public:
  template <typename T> void output_integer(T var) {
    if (var == 0) {
      putchar('0');
      return;
    }
    if (var < 0)
      putchar('-'), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p)
      putchar(stack[--stack_p]);
  }
  MyPrinter &operator<<(char c) {
    putchar(c);
    return *this;
  }
  MyPrinter &operator<<(double x) {
    printf("%.10f\n", x);
    return *this;
  }
  template <typename T> MyPrinter &operator<<(T var) {
    output_integer<T>(var);
    return *this;
  }
  MyPrinter &operator<<(char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const string &str) {
    const char *p = str.c_str();
    const char *l = p + str.size();
    while (p < l)
      putchar(*p++);
    return *this;
  }
  template <typename T> void operator()(T x) { *this << x << newl; }
  template <typename T, typename... Ts> void operator()(T x, Ts... xs) {
    *this << x << " ";
    this->operator()(xs...);
  }
  template <typename Iter> void iter(Iter s, Iter t) {
    if (s == t)
      *this << "\n";
    else {
      for (; s != t; s++) {
        *this << *s << " \n"[next(s, 1) == t];
      }
    }
  }
  template <typename Range> void range(const Range &r) {
    iter(begin(r), end(r));
  }
} OUT;

class DebugPrint {
public:
  template <typename T> DebugPrint &operator<<(const T &v) {
#ifdef LOCAL
    cerr << v;
#endif
    return *this;
  }
} debugos;

#pragma GCC diagnostic ignored "-Wshadow"
template <typename T, typename Cmb, typename Upd> struct segtree {
  const int n;
  const T unit;
  const Cmb cmb;
  const Upd upd;
  vector<T> data;
  segtree(int n = 0, T unit = T(), Cmb cmb = Cmb(), Upd upd = Upd())
      : n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1, unit) {
    build();
  }
  template <typename Iter>
  segtree(Iter first, Iter last, int n, T unit = T(), Cmb cmb = Cmb(),
          Upd upd = Upd())
      : n(n), unit(unit), cmb(cmb), upd(upd), data(n << 1) {
    assign(first, last);
  }
  void build() { repr(i, n) data[i] = cmb(data[i << 1], data[i << 1 | 1]); }
  template <typename Iter> void assign(Iter first, Iter last) {
    copy(first, last, data.begin() + n);
    build();
  }
  void modify(int l, T v) {
    l += n;
    data[l] = upd(data[l], v);
    for (; l > 1; l >>= 1)
      data[l >> 1] = cmb(data[l & (~1)], data[l | 1]);
  }
  T query(int l, int r) {
    if (l == r)
      return unit;
    if (l + 1 == r)
      return data[l + n];
    T resl = data[l += n], resr = data[(r += n) - 1];
    for (l++, r--; l < r; l >>= 1, r >>= 1) {
      if (l & 1)
        resl = cmb(resl, data[l++]);
      if (r & 1)
        resr = cmb(data[--r], resr);
    }
    return cmb(resl, resr);
  }
};
#pragma GCC diagnostic warning "-Wshadow"

template <typename T> struct minT {
  T operator()(T a, T b) const { return min(a, b); }
};

template <typename T> struct maxT {
  T operator()(T a, T b) const { return max(a, b); }
};

template <typename T> struct assign {
  T operator()(T a, T b) const { return b; }
};

template <typename T, typename Upd = assign<T>>
using RangeMin = segtree<T, minT<T>, Upd>;

template <typename T, typename Upd = assign<T>>
using RangeMax = segtree<T, maxT<T>, maxT<T>>;

template <typename T, typename U>
ostream &operator<<(ostream &out, pair<T, U> var) {
  return out << var.first << " " << var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
ostream &tuple_impl(ostream &out, Tuple var) {
  return out;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
ostream &tuple_impl(ostream &out, Tuple var) {
  out << get<I>(var) << " ";
  return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename... Ts> ostream &operator<<(ostream &out, tuple<Ts...> var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename T, typename U>
MyPrinter &operator<<(MyPrinter &out, pair<T, U> var) {
  return out << var.first << " " << var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, Tuple var) {
  return out;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, Tuple var) {
  out << get<I>(var) << " ";
  return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename... Ts>
MyPrinter &operator<<(MyPrinter &out, tuple<Ts...> var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename T, typename U>
MyScanner &operator>>(MyScanner &in, pair<T, U> &var) {
  return in >> var.first >> var.second;
}
template <typename... Ts>
MyScanner &operator>>(MyScanner &in, tuple<Ts...> &var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(in, var);
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  return in;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  in >> get<I>(var);
  return tuple_impl<Tuple, I + 1, N>(in, var);
}

#pragma GCC diagnostic ignored "-Wshadow"
struct union_find {
  int n;
  vector<int> par, rank, sz;
  union_find(int n) : n(n), par(n), rank(n), sz(n) {
    iota(all(par), 0);
    fill(all(sz), 1);
  }
  int root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }
  void merge(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y)
      return;
    if (rank[x] < rank[y])
      swap(x, y);
    par[y] = x;
    if (rank[x] == rank[y])
      rank[x]++;
    sz[x] += sz[y];
  }
  bool same(int x, int y) { return root(x) == root(y); }
  int size(int x) { return sz[root(x)]; }
};
#pragma GCC diagnostic warning "-Wshadow"

int main() {
  int n = IN;
  auto S = IN.v<string>(n);

  VI m(n, -1);
  m[0] = 0;
  rep(n) rep(i, n) if (m[i] != -1) rep(j, n) if (S[i][j] == '1') {
    if (m[i] == m[j])
      EXIT(-1);
    m[j] = not m[i];
  }

  auto d = make_v(n, n, INF);
  rep(i, n) d[i][i] = 0;
  rep(i, n) rep(j, n) if (S[i][j] == '1') d[i][j] = 1;
  rep(k, n) rep(i, n) rep(j, n) chmin(d[i][j], d[i][k] + d[k][j]);

  int D = 0;
  rep(i, n) rep(j, n) chmax(D, d[i][j]);
  OUT(D + 1);
}