Codeforces Round #580 (Div. 2)D. Shortest Cycle【floyd】

D. Shortest Cycle

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given nn integer numbers a1,a2,…,ana1,a2,…,an. Consider graph on nn nodes, in which nodes ii, jj (i≠ji≠j) are connected if and only if, aiaiAND aj≠0aj≠0, where AND denotes the bitwise AND operation.

Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at all.

Input

The first line contains one integer nn (1≤n≤105)(1≤n≤105) — number of numbers.

The second line contains nn integer numbers a1,a2,…,ana1,a2,…,an (0≤ai≤10180≤ai≤1018).

Output

If the graph doesn't have any cycles, output −1−1. Else output the length of the shortest cycle.

Examples

input

Copy

4
3 6 28 9

output

Copy

4

input

Copy

5
5 12 9 16 48

output

Copy

3

input

Copy

4
1 2 4 8

output

Copy

-1

Note

In the first example, the shortest cycle is (9,3,6,28)(9,3,6,28).

In the second example, the shortest cycle is (5,12,9)(5,12,9).

The graph has no cycles in the third example.

 

 

分析：好像可以用各种高超的技巧卡过去？不是很懂。

首先不考虑范围，这就是一个无向图最小环问题，然而数据有1e5？这题能做？

我们来考虑一下建边的条件，a[i]&a[j] ！= 0就表示ij存在一条边，同时a[i]最多1e18，也就是说，这个图是十分稠密的，稠密到n稍微大一点，答案就肯定是3了。注意一下这里不是简单的判断n就可以了，我们需要把0去掉。

那么n多大答案才会是3呢？大概是大于128？1，1，2，2，4，4，8，8，16，16……这种情况吧？

那么如果不是3，就直接用floyd跑一个无向图的最小环就可以了，网上有很多博客这里就不细讲了。

#include "bits/stdc++.h"

using namespace std;
const int INF = 0x3f3f3f3f / 3;
long long a[100004];
int mp[200][200];
int dis[200][200];
int n;
int ans;

void floyd() {
    ans = INF;
    for (int k = 1; k <= n; ++k) {
        for (int i = 1; i <= k; ++i) {
            for (int j = i + 1; j <= k; ++j) {
                ans = min(ans, dis[i][j] + mp[i][k] + mp[k][j]);
            }
        }

        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                if (dis[i][j] > dis[i][k] + dis[k][j])
                    dis[i][j] = dis[i][k] + dis[k][j];
            }
        }
    }
}

void init() {
    memset(mp, INF, sizeof(mp));
    memset(dis, INF, sizeof(dis));
}

int main() {
    cin >> n;
    init();
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
    }
    int cnt = 2;
    for (int i = 2; i <= n; ++i) {
        if (a[i] == 0)continue;
        else a[cnt++] = a[i];
    }
    n = cnt - 1;
    if (n > 128)return 0 * puts("3");
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j < i; ++j) {
            if (a[i] & a[j]) {
                mp[i][j] = mp[j][i] = 1;
                dis[i][j] = dis[j][i] = 1;
            }
        }
    }
    floyd();
    if (ans < INF)printf("%d\n", ans);
    else puts("-1");
}