神秘问题求助

#include<bits/stdc++.h>
using namespace std;
const int NR=1e5+105;
int T,C,n;
/*
n+1:JX1
n+2:JX2
n+3:NX1
n+4:NX2
*/
vector<int> g[NR];

int vis[NR],p[NR];
bool lcz;
void dfs(int x,int d){
	if(lcz) return;
	for(auto y:g[x]){
		if(y==1&&d==2*n-1&&((x<n+3)==(vis[y]&1))){
			lcz=1;
			cout<<"YES";
			if(C){
				cout<<"\n";
				for(int i=0;i<=d;i++){
					if(p[i]<=n) cout<<p[i]<<" ";
				}
				cout<<"\n";
				for(int i=0;i<=d;i++){
					if(p[i]<=n) cout<<(vis[p[i]]==1?'J':'N');
				}
//				cout<<"\n";
			}
			return;
		}
		if(y>n&&((y-n)&1)!=(vis[x]&1)){
			continue;	
		}
		if(y<=n&&vis[y]){
			continue;
		}
		if(x>n) vis[y]=(x>n+2?2:1);
		p[d+1]=y;
		dfs(y,d+1);
		vis[y]=0;
	}
}

int main(){
//	freopen("2.in","r",stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>T>>C;
	while(T--){
		cin>>n;
		for(int i=1;i<=n+4;i++){
			g[i].clear();
		}
		for(int i=1;i<=n;i++){
			char c;
			cin>>c;
			if(c=='J'){
				g[n+1].push_back(i);
				g[n+4].push_back(i);
			}
			else{
				g[n+2].push_back(i);
				g[n+3].push_back(i);
			}
		}
		for(int i=1;i<=n;i++){
			char c;
			cin>>c;
			if(c=='J'){
				g[i].push_back(n+1);
				g[i].push_back(n+4);
			}
			else{
				g[i].push_back(n+2);
				g[i].push_back(n+3);
			}
		}
		lcz=0;
		p[0]=1;
		memset(vis,0,sizeof(vis));
		vis[1]=1;
		dfs(1,0);
		memset(vis,0,sizeof(vis));
		vis[1]=2;
		dfs(1,0);
		if(!lcz) cout<<"NO";
		if(T!=0) cout<<"\n";
	}
	return 0; 
} 
/*
1 0
3
NNN
NNN
*/