cf round #599 div2 B2 Character Swap (Hard Version)

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

#include<iostream>
#include<string>
#include<map>
#include<cmath>
#include<cstring>
#include<vector>
#define f(i,l,r) for(i=(l);i<=(r);i++)
using namespace std;
int T,n;
string a,b;
map<char,int> mp;
int flag,ans;
int op[2][1000];
int main()
{
    int i,j;
    cin>>T;
    while(T--){
        mp.clear();
        ans=0;
        flag=0;
        cin>>n;
        cin>>a>>b;
        f(i,0,n-1){
            if(a[i]==b[i]) continue;
            mp[a[i]]++;
            mp[b[i]]++;
        }
        map<char,int>::iterator it;
        for(it=mp.begin();it!=mp.end();it++){
            if(it->second&1){
                flag=1;
            }
        }
        if(flag){
            cout<<"no"<<endl;
            continue;
        }
        else cout<<"yes"<<endl;
        f(i,0,n-1){
            if(a[i]==b[i]) continue;
            f(j,i+1,n-1){
                if(a[j]==b[j]) continue;
                if(a[i]!=a[j]&&a[i]!=b[j]) continue;
                if(a[i]==a[j]){
                    a[j]=b[i];
                    ans++;
                    op[0][ans]=j+1;
                    op[1][ans]=i+1;
                }
                else{
                    ans++;
                    op[0][ans]=j+1;
                    op[1][ans]=j+1;
                    ans++;
                    op[0][ans]=j+1;
                    op[1][ans]=i+1;
                    b[j]=a[j];
                    a[j]=b[i];
                }
                break;
            }
        }
        cout<<ans<<endl;
        f(i,1,ans){
            cout<<op[0][i]<<" "<<op[1][i]<<endl;
        }
    }
    return 0;
}

#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<vector>
#define f(i,l,r) for(i=(l);i<=(r);i++)
using namespace std;
int T,n;
string a,b;
map<char,int> mp;
set<int> s1[30],s2[30];
vector<pair<int,int>> ans;
int flag,sum;
int op[2][1000];
int main()
{
    int i,j;
    cin>>T;
    while(T--){
        mp.clear();
        ans.clear();
        sum=0;
        flag=0;
        cin>>n;
        cin>>a>>b;
        f(i,0,n-1){
            if(a[i]==b[i]) continue;
            mp[a[i]]++;
            mp[b[i]]++;
        }
        for(auto &it: mp){
            if(it.second&1){
                flag=1;
            }
        }
        if(flag){
            cout<<"no"<<endl;
            continue;
        }
        else cout<<"yes"<<endl;
        f(i,0,n-1){
            if(a[i]==b[i]) continue;
            s1[a[i]-'a'].insert(i);
            s2[b[i]-'a'].insert(i);
        }
        f(i,0,n-1){
            if(a[i]==b[i]) continue;
            s1[a[i]-'a'].erase(i);
            s2[b[i]-'a'].erase(i);
            if(s1[a[i]-'a'].size()){
                int j=*s1[a[i]-'a'].begin();
                sum++;
                ans.push_back(make_pair(j+1,i+1));
                s1[a[i]-'a'].erase(j);
                s1[b[i]-'a'].insert(j);
                a[j]=b[i];
                if(a[j]==b[j]){
                    s1[a[j]-'a'].erase(j);
                    s2[a[j]-'a'].erase(j);
                }
            }
            else{
                int j=*s2[a[i]-'a'].begin();
                sum+=2;
                ans.push_back(make_pair(j+1,j+1));
                ans.push_back(make_pair(j+1,i+1));
                s1[a[j]-'a'].erase(j);
                s1[b[i]-'a'].insert(j);
                s2[b[j]-'a'].erase(j);
                s2[a[j]-'a'].insert(j);
                b[j]=a[j];
                a[j]=b[i];
                if(a[j]==b[j]){
                    s1[a[j]-'a'].erase(j);
                    s2[a[j]-'a'].erase(j);
                }
            }
        }
        cout<<sum<<endl;
        for(auto &it: ans){
            cout<<it.first<<" "<<it.second<<endl;
        }
    }
    return 0;
}