B2. Character Swap (Hard Version)

http://codeforces.com/contest/1243/problem/B2 

#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=1e5+9;

int n;
string s,t;
vector<pair<int,int> >ans;
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    int T;
    cin>>T;
    while(T--)
    {
        ans.clear();
        cin>>n;
        cin>>s>>t;
        for(int i=0;i<n;i++)
        {
            if(s[i]!=t[i])
            {
                bool f=0;
                for(int j=i+1;j<n;j++)
                {
                    if(s[j]==s[i])
                    {
                        f=1;
                        ans.pb({j,i});
                        swap(s[j],t[i]);
                        break;
                    }
                }
                if(!f)
                {
                    for(int j=i+1;j<n;j++)
                    {
                        if(t[j]==t[i])
                        {
                            f=1;
                            ans.pb({i,j});
                            swap(s[i],t[j]);
                            break;
                        }
                    }
                }
                if(!f)
                {
                    for(int j=i+1;j<n;j++)
                    {
                        if(t[j]==s[i])
                        {
                            f=1;
                            ans.pb({n-1,j});
                            ans.pb({n-1,i});
                            swap(s[n-1],t[j]);
                            swap(s[n-1],t[i]);
                            break;
                        }
                    }
                }
                if(!f)
                {
                    for(int j=i+1;j<n;j++)
                    {
                        if(s[j]==t[i])
                        {
                            f=1;
                            ans.pb({j,n-1});
                            ans.pb({i,n-1});
                            swap(s[j],t[n-1]);
                            swap(s[i],t[n-1]);
                            break;
                        }
                    }
                }
            }
        }
        //cout<<s<<" "<<t<<endl;
        if(s==t)
        {
            cout<<"Yes"<<endl;
            cout<<ans.size()<<endl;
            for(int i=0;i<ans.size();i++) cout<<ans[i].first+1<<" "<<ans[i].second+1<<endl;
        }
        else cout<<"No"<<endl;
    }

    return 0;
}