SOCIALNE - Possible Friends.md

Algorithm : Floyd Warshall

Problem : Possible Friends

/**
***********************************************************************************
    ██████       ████████████    ▄████████   ███████████    ██       ██ 
    ███  ███   ███  ███       ▀  ███     █▀   ▀▀  ██   ▀▀   ██       ██
    ███   ██████    ███    ▄     ███              ██        ██       ██
    ███     ███      ██████      ▀████████        ██        ██       ██
    ███              ███    ▀            ███      ██        ██       ██  
    ███              ███       ▄   ▄█    ███      ██          ▀       ▀
    ███              █████████  ▄████████▀        ██           █████
***********************************************************************************
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vi> 
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vb vector<bool>
#define vs vector<string>
///............x...........///
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ff first
#define ss second
#define bg begin()
#define UNIQUE(X) (X).erase(unique(all(X)), (X).end())
#define ft cout << "for test"<<endl;
#define read(v, a, n) for (int i = a; i<n; i++)cin>>v[i];
#define print(v) for (auto it : v)cout << it<<' ';cout << endl;
#define PI acos(-1.0)
#define yes cout <<"Yes"<< endl
#define no cout<<"No"<<endl
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define t_c int test, cs = 1;cin>>test;while (test--)
#define casep cout<<"Case "<< cs++<<": ";
///................function.....................///

#define D(a) (double)(a)
#define sqr(a) (a * a)
#define siz(s) (int)(s.size())
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define Min(a) *min_element(all(a))
///.........Graph.........///
int X[] = {1, -1, 0, 0};
int Y[] = {0, 0, 1, -1};
///........constant........///
const ll N = 2005;
const ll mod = 1e9+7;
const ll inf = 100000000;
int main(){
    FIO;
    t_c{
        vs s;
        string a;cin>>a;s.pb(a);
        int m = siz(a),i,j;
        for(i=1; i<m; i++){
            cin>>a;s.pb(a);
        }
        int cnt[m];
        for(i=0; i<m; i++)cnt[i]=0;
        for(i=0; i<m; i++){
            for(j=i+1; j<m; j++){
                if(s[i][j]=='N'){
                    for(int k=0; k<m; k++){
                        if(s[i][k]=='Y'&&s[k][j]=='Y'){
                            cnt[i]++,cnt[j]++;break;
                        }
                    }
                }
            }
        }
        int mx=0,pos=0;
        for(i=0; i<m; i++){
            if(mx<cnt[i]){
                mx = cnt[i];
                pos=i;
            }
        }
        cout<<pos<<" "<<mx<<endl;
    }

}