SPOJ/TFRIENDS.cpp at master · adityaagg09/SPOJ · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
// True Friends

#include <bits/stdc++.h>
using namespace std;

vector<int> v[200];
vector<pair<int,int> >vec;
int visited[200];
int ctr;

void dfs(int i)
{
    visited[i]=1;
    for(int j=0;j<v[i].size();++j)
    if(visited[v[i][j]]==0)
    {
        ++ctr;
        dfs(v[i][j]);
    }
    ++ctr;
    vec.push_back({i,ctr});
}

bool comp(pair<int,int> i,pair<int,int> j)
{
    return i.second>j.second;
}

int main() {
	int t,n,i,j;
	cin>>t;
	while(t>0)
	{
	    cin>>n;
	    char ch[n][n];
	    vec.clear();
	    ctr=0;
	    for(i=0;i<=n;++i)
	    v[i].clear(),visited[i]=0;
	    for(i=0;i<n;++i)
	    cin>>ch[i];
	    for(i=0;i<n;++i)
	    for(j=0;j<n;++j)
	    if(ch[i][j]=='Y')
	    v[i+1].push_back(j+1);
	    for(i=1;i<=n;++i)
	    {
	        if(visited[i]==0)
	        {
	        dfs(i);
	        }
	    }
	    for(i=0;i<=n;++i)
	    v[i].clear(),visited[i]=0;
	    for(i=0;i<n;++i)
	    for(j=0;j<n;++j)
	    if(ch[i][j]=='Y')
	    v[j+1].push_back(i+1);
	    int count=0;
	    sort(vec.begin(),vec.end(),comp);
	    for(i=0;i<n;++i)
	    if(visited[vec[i].first]==0)
	    {
	        dfs(vec[i].first);
	        ++count;
	    }
	    cout<<count<<endl;
	    --t;
	}
	return 0;
}