美好的邂逅(floyd)

美好的邂逅

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 305;
const int INF = 0x3f3f3f3f;
int group1[MAXN];
int group2[MAXN];
int G[MAXN][MAXN];
int n, m, t;

void floyd()
{
    for(int k = 1; k <= n; ++k)
    {
        for(int i = 1; i <= n; ++i)
        {
            for(int j = 1; j <= n; ++j)
            {
                if( (i != j) && (G[i][j] > G[i][k] + G[k][j]))
                {
                    G[i][j] = G[i][k] + G[k][j];
                }
            }
        }
    }
}

void print()
{
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            if( (i != j) )
            {
                cout << G[i][j] << " ";
            }
        }
        cout << endl;
    }
}

int main()
{
    //freopen("data.in","r",stdin);
    //freopen("data.out","w",stdout);
    ios::sync_with_stdio(false);

    memset(G, INF, sizeof(G));

    cin >> n >> m;
    for(int i = 0; i < m ; ++i)
    {
        int a, b;
        cin >> a >> b ;
        G[a][b] = 1;
        G[b][a] = 1;
    }

    floyd();
    //print();

     for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            if( (i != j) && G[i][j] > 7)
            {
                cout << "No" << endl;
                return 0;
            }
        }
    }

    cout << "Yes" << endl;
    return 0;
}