Problem:
Score : 500 points

Problem Statement

Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S.
If S_{i,j} is 1, there is an edge connecting Vertex i and j; otherwise, there is no such edge.

Determine whether it is possible to divide the vertices into non-empty sets V_1, \dots, V_k such that the following condition is satisfied. If the answer is yes, find the maximum possible number of sets, k, in such a division.

Every edge connects two vertices belonging to two "adjacent" sets. More formally, for every edge (i,j), there exists 1\leq t\leq k-1 such that i\in V_t,j\in V_{t+1} or i\in V_{t+1},j\in V_t holds.

Constraints

2 \leq N \leq 200

S_{i,j} is 0 or 1.

S_{i,i} is 0.

S_{i,j}=S_{j,i}

The given graph is connected.

N is an integer.

Input

Input is given from Standard Input in the following format:

N
S_{1,1}...S_{1,N}
:
S_{N,1}...S_{N,N}

Output

If it is impossible to divide the vertices into sets so that the condition is satisfied, print -1.
Otherwise, print the maximum possible number of sets, k, in a division that satisfies the condition.

Sample Input 1

2
01
10

Sample Output 1

2

We can put Vertex 1 in V_1 and Vertex 2 in V_2.

Sample Input 2

3
011
101
110

Sample Output 2

-1

Sample Input 3

6
010110
101001
010100
101000
100000
010000

Sample Output 3

4

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn is_bipartite(node: usize, nodes: &Vec<Vec<usize>>, colors: &mut Vec<Option<bool>>, color: bool) -> bool {
    for &next in &nodes[node] {
        if let Some(ncolor) = colors[next] {
            if ncolor == color {
                return false;
            }
            continue;
        }
        colors[next] = Some(!color);
        let res = is_bipartite(next, nodes, colors, !color);
        if !res {
            return false;
        }
    }
    true
}

fn dfs(node: usize, nodes: &Vec<Vec<usize>>, visited: &mut Vec<bool>, depth: usize) -> (usize, usize) { //(depth,node)
    let mut mx = 0;
    let mut mnode = 0;
    for &next in &nodes[node] {
        if visited[next] {
            continue;
        }
        visited[next] = true;
        let (dep, nn) = dfs(next, nodes, visited, depth+1);
        if dep > mx {
            mx = dep;
            mnode = nn;
        }
    }
    if mx == 0 {
        (depth, node)
    } else {
        (mx, mnode)
    }
}

fn solve() {
    let n = get!(usize);
    let s = get!(String; n);
    let mut nodes = vec![Vec::new(); n];
    for i in 0..n {
        let tmp = s[i].chars().map(|e| e == '1').collect::<Vec<_>>();
        for j in 0..n {
            if tmp[j] {
                nodes[i].push(j);
            }
        }
    }
    let mut colors = vec![None; n];
    colors[0] = Some(false);
    let res = is_bipartite(0, &nodes, &mut colors, false);
    if !res {
        println!("-1");
        return;
    }
    let mut visited = vec![false;n];
    visited[0] = true;
    let (_, node) = dfs(0, &nodes, &mut visited, 0);
    let mut visited = vec![false;n];
    visited[node] = true;
    let (diameter, _) = dfs(node, &nodes, &mut visited, 0);
    println!("{}", diameter+1);
}