题目链接
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int in[2020];
char s;
int main(){
int N;
scanf("%d",&N);
while(N--){
int n;
scanf("%d",&n);
vector<int>edge[2022];
memset(in,0,sizeof(in));
vector<int>ans;
queue<int>q;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>s;
if(s=='P'){
in[j]++;
edge[i].push_back(j);
}
else if(s=='Q'){
in[i]++;
edge[j].push_back(i);
}
}
}
for(int i=0;i<n;i++){
if(in[i]==0){
q.push(i);
}
}
while(!q.empty()){
int p=q.front();q.pop();
ans.push_back(p);
for(int i=0;i<edge[p].size();i++){
int y=edge[p][i];
in[y]--;
if(in[y]==0)q.push(y);
}
}
if(ans.size()!=n){
printf("N\n");
}
else printf("T\n");
}
}