43分TLE求优化

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,q,i,j,x,y,u,v,w;
	char c;
	cin>>n>>q;
	int a[n*2+1];
	for(i=0;i<n*2+1;i++)
		a[i]=i; 
	for(i=0;i<q;i++)
	{
		cin>>c>>x>>y;
		if(c=='A')
		{
			for(u=x;u!=a[u];u=a[u]);
			for(v=y+n;v!=a[v];v=a[v]);
			a[u]=v;
			u=x;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
			u=y+n;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
			for(u=x+n;u!=a[u];u=a[u]);
			for(v=y;v!=a[v];v=a[v]);
			a[u]=v;
			u=x+n;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
			u=y;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
		}
		if(c=='R')
		{
			for(u=x;u!=a[u];u=a[u]);
			for(v=y;v!=a[v];v=a[v]);
			a[u]=v;
			u=x;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
			u=y;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
			for(u=x+n;u!=a[u];u=a[u]);
			for(v=y+n;v!=a[v];v=a[v]);
			a[u]=v;
			u=x+n;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
			u=y+n;
			while(u!=a[u])
			{
				w=u;
				u=a[u];
				a[w]=v;
			}
		}
		if(c=='Q')
		{
			for(u=x;u!=a[u];u=a[u]);
			for(v=y;v!=a[v];v=a[v]);
			if(u==v)
			{
				cout<<"R\n";
				continue;
			}
			for(u=x;u!=a[u];u=a[u]);
			for(v=y+n;v!=a[v];v=a[v]);
			if(u==v)
			{
				cout<<"A\n";
				continue;
			}
			cout<<"?\n";
		}
	}
	return 0; 
 }