94B - Friends - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
bool bsf(vector<int> adj[],int vis[],int n,int p)
{
    queue<pair<pair<int,int>,int>> q;
    q.push({{n,p},0});
    unordered_map<int,int> m;
    while(!q.empty())
    {
        int n=q.front().first.first;
        int p=q.front().first.second;
        int l=q.front().second;
        q.pop();
        for(auto it:adj[n])
        {
            if(!vis[it])
            {
                q.push({{it,n},l+1});
                vis[it]=1;
            }
            else
            {
                if(it!=p&&l==1&&m[it]==1)
                return true;
            }
        }
        m[n]=1;

    }
return false;

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    vector<int> adj[6];
    vector<int> nonadj[6];
    for (int i = 1; i < 6; i++)
    {
        for (int j = 1; j < 6; j++)
        {
            if(i!=j)
            nonadj[i].push_back(j);
        }       
        
    }
    int m;
    cin>>m;
    for (int i = 0; i < m; i++)
    {
        int u,v;
        cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
        auto pos=find(nonadj[u].begin(),nonadj[u].end(),v);
    nonadj[u].erase(pos);
    auto pos2=find(nonadj[v].begin(),nonadj[v].end(),u);
    nonadj[v].erase(pos2);
        
    }
    // for(int i=1;i<6;i++)
    // {
    //     for(auto it:nonadj[i])
    //     cout<<it<<" ";
    //     cout<<endl;
    // }
    

   for(int i=1;i<6;i++)
   {
    // if(!vis[i])
    {
        int vis[6]={0};
        vis[i]=1;
        if(bsf(adj,vis,i,-1))
        {
            cout<<"WIN"<<endl;
            return 0;
        }
    }
   }


   for(int i=1;i<6;i++)
   {
    // if(!vis2[i])
    {
        int vis2[6]={0};
        vis2[i]=1;
        if(bsf(nonadj,vis2,i,-1))
        {
            cout<<"WIN"<<endl;
            return 0;
        }
    }
   }
   cout<<"FAIL"<<endl;
    return 0;
}